注册 | 登录 | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

AbnerCYH's graph [353 articles]

当前文献位于 AbnerCYH's 文献库 标签分类为 graph. You can also see everyone's graph.
  • Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
    Automata, Languages and Programming (2008), pp. 634-645.
    by Marc Tedder, Derek Corneil, Michel Habib, Christophe Paul
    posted to order graph algorithms by AbnerCYH on 2008-07-18 18:43:02 as **
  • Unraveling Protein Networks with Power Graph Analysis
    PLoS Comput Biol, Vol. 4, No. 7. (11 July 2008), e1000108.
    by Loïc Royer, Matthias Reimann, Bill Andreopoulos, Michael Schroeder
    posted to graph complex biology algorithms by AbnerCYH on 2008-07-18 18:28:57 as ** along with 12 people and 1 group jmuhlich royerloic tmmurali stajich chad_davis renatomilani askrajiv Borelli nuin reyez kengg Ema Berkeley Mycology
  • Modular decomposition of protein-protein interaction networks.
    Genome Biol, Vol. 5, No. 8. (2004)
    by J Gagneur, R Krause, T Bouwmeester, G Casari
    posted to graph biology algorithms by AbnerCYH on 2008-07-15 03:23:42 as ** along with 1 person ezotenko
  • The algorithmic aspects of the regularity lemma
    Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on (1992), pp. 473-481.
    by N Alon
    posted to graph combinatorics algorithms by AbnerCYH on 2008-07-08 12:35:49 as **
  • The Turán Theorem for Random Graphs
    Comb. Probab. Comput., Vol. 13, No. 1. (January 2004), pp. 61-91.
    by Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht
    posted to stochastic graph combinatorics by AbnerCYH on 2008-07-06 19:26:23 as **
  • Regular pairs in sparse random graphs I
    Random Struct. Algorithms, Vol. 22, No. 4. (July 2003), pp. 359-434.
    by Y Kohayakawa, V Rödl
    posted to stochastic graph combinatorics by AbnerCYH on 2008-07-06 19:26:15 as **
  • Hypergraphs, quasi-randomness, and conditions for regularity
    J. Comb. Theory Ser. A, Vol. 97, No. 2. (February 2002), pp. 307-352.
    by Yoshiharu Kohayakawa, Vojtech Rödl, Jozef Skokan
    posted to stochastic graph combinatorics by AbnerCYH on 2008-07-06 19:24:37 as **
  • Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems
    (2002), pp. 74-83.
    by Béla Csaba, Marek Karpinski, Piotr Krysta
    posted to testing graph complexity combinatorics algorithms by AbnerCYH on 2008-07-06 19:24:02 as **
  • Property testing in hypergraphs and the removal lemma
    (2007), pp. 488-495.
    by V Rödl, M Schacht
    posted to testing graph combinatorics algorithms by AbnerCYH on 2008-07-06 19:23:40 as **
  • Integer and fractional packings of hypergraphs
    Journal of Combinatorial Theory, Series B, Vol. 97, No. 2. (March 2007), pp. 245-268.
    by V Rödl, M Schacht, MH Siggers, N Tokushige
    posted to optimization graph algorithms by AbnerCYH on 2008-07-06 19:22:50 as **
  • Testing versus estimation of graph properties
    (2005), pp. 138-146.
    by Eldar Fischer, Ilan Newman
    posted to testing graph combinatorics algorithms by AbnerCYH on 2008-07-06 19:22:35 as **
  • The algorithmic aspects of the regularity lemma
    J. Algorithms, Vol. 16, No. 1. (January 1994), pp. 80-109.
    by N Alon, RA Duke, H Lefmann, V R&\#246;dl, R Yuster
    posted to testing stochastic graph combinatorics algorithms by AbnerCYH on 2008-07-05 14:09:51 as ***** along with 1 person bfraser
  • The regularity lemma and approximation schemes for dense problems
    (1996)
    by A Frieze
    posted to testing stochastic graph combinatorics algorithms by AbnerCYH on 2008-07-05 14:09:49 as **
  • Property testing and its connection to learning and approximation
    J. ACM, Vol. 45, No. 4. (July 1998), pp. 653-750.
    by Oded Goldreich, Shari Goldwasser, Dana Ron
    posted to testing stochastic graph combinatorics algorithms by AbnerCYH on 2008-07-05 14:09:45 as **
  • On characterizing hypergraph regularity
    Random Struct. Algorithms, Vol. 21, No. 3-4. (2002), pp. 293-335.
    by Y Dementieva, PE Haxell, B Nagle, V Rödl
    posted to testing stochastic graph combinatorics algorithms by AbnerCYH on 2008-07-05 14:09:28 as **
  • An optimal algorithm for checking regularity: (extended abstract)
    (2002), pp. 277-286.
    by Y Kohayakawa, V Rödl, L Thoma
    posted to testing stochastic graph combinatorics algorithms by AbnerCYH on 2008-07-05 14:08:58 as **
  • Hardness of fully dense problems
    Inf. Comput., Vol. 205, No. 8. (August 2007), pp. 1117-1129.
    by Nir Ailon, Noga Alon
    posted to testing stochastic graph combinatorics algorithms by AbnerCYH on 2008-07-05 14:08:27 as **
  • On minimum -connected k -dominating set problem in unit disc graphs
    Journal of Combinatorial Optimization, Vol. 16, No. 2. (2008), pp. 99-106.
    by Weiping Shang, Frances Yao, Pengjun Wan, Xiaodong Hu
    posted to graph algorithms by AbnerCYH on 2008-07-05 08:09:32 as **
  • Quasi-bicliques: Complexity and Binding Pairs
    Computing and Combinatorics (2008), pp. 255-264.
    by Xiaowen Liu, Jinyan Li, Lusheng Wang
    posted to graph complexity algorithms by AbnerCYH on 2008-07-04 11:00:06 as **
  • Spreading Messages
    Computing and Combinatorics (2008), pp. 587-599.
    by Ching-Lueh Chang, Yuh-Dauh Lyuu
    posted to graph algorithms by AbnerCYH on 2008-07-04 10:42:22 as **
  • Optimal Insertion of a Segment Highway in a City Metric
    Computing and Combinatorics (2008), pp. 611-620.
    by Matias Korman, Takeshi Tokuyama
    posted to graph geometries algorithms by AbnerCYH on 2008-07-04 10:42:16 as **
  • Transcription factor modularity in a gene-centered C. elegans core neuronal protein-DNA interaction network
    Genome Res., Vol. 17, No. 7. (1 July 2007), pp. 1061-1071.
    by Vanessa Vermeirssen, Inmaculada M Barrasa, Cesar A Hidalgo, Jenny A Babon, Reynaldo Sequerra, Lynn Doucette-Stamm, Albert-Laszlo Barabasi, Albertha J Walhout
    posted to kdd graph complex biology by AbnerCYH on 2008-07-03 20:20:30 as **
  • Epidemic dynamics and endemic states in complex networks
    Physical Review E, Vol. 63, No. 6. (22 May 2001), 066117.
    by Romualdo Pastor-Satorras, Alessandro Vespignani
    posted to graph dynamics complex biology by AbnerCYH on 2008-07-03 19:28:36 as **
  • Epidemic Spreading in Scale-Free Networks
    Physical Review Letters, Vol. 86, No. 14. (2 April 2001), 3200.
    by Romualdo Pastor-Satorras, Alessandro Vespignani
    posted to graph dynamics complex biology by AbnerCYH on 2008-07-03 19:28:17 as ** along with 1 person rcrane
  • The Regularity Lemma and Its Applications in Graph Theory
    Theoretical Aspects of Computer Science (2002), pp. 149-152.
    by János Komlós, Ali Shokoufandeh, Miklós Simonovits, Endre Szemerédi
    posted to testing stochastic graph combinatorics algorithms by AbnerCYH on 2008-07-03 14:26:39 as **
  • Identification of Functional Information Subgraphs in Complex Networks
    Physical Review Letters, Vol. 100, No. 23. (2008)
    by Lu\is MA Bettencourt, Vadas Gintautas, Michael I Ham
    posted to graph complex algorithms by AbnerCYH on 2008-07-03 13:58:51 as ** along with 2 people rsantana stringertheory
  • An algorithm for modularity analysis of directed and weighted biological networks based on edge-betweenness centrality.
    Bioinformatics (Oxford, England), Vol. 22, No. 24. (15 December 2006), pp. 3106-3108.
    by J Yoon, A Blumer, K Lee
    posted to kdd graph complex biology algorithms by AbnerCYH on 2008-07-01 03:36:10 as *** along with 1 person hryk
  • Coherent closed quasi-clique discovery from large dense graph databases
    (2006), pp. 797-802.
    by Zhiping Zeng, Jianyong Wang, Lizhu Zhou, George Karypis
    posted to kdd graph algorithms by AbnerCYH on 2008-06-30 17:42:22 as **
  • A computational analysis of the protein-protein interaction networks in neurodegenerative diseases
    BMC Systems Biology, Vol. 2, No. 1. (2008)
    by Joaquin Goni, Francisco Esteban, Nieves V de Mendizabal, Jorge Sepulcre, Sergio A Treijano, Ion Agirrezabal, Pablo Villoslada
    posted to kdd graph complex biology algorithms by AbnerCYH on 2008-06-27 05:29:43 as ** along with 3 people reyez renatomilani bootsy
  • Modular cell biology: retroactivity and insulation
    Mol Syst Biol, Vol. 4 (12 February 2008)
    by Domitilla Del Vecchio, Alexander J Ninfa, Eduardo D Sontag
    posted to graph complex biology by AbnerCYH on 2008-06-26 03:48:59 as ** along with 5 people roys austin margaritis rsantana pmendes
  • Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
    SIAM Journal on Computing, Vol. 29, No. 5. (2000), pp. 1449-1483.
    by Michael Saks, Fotios Zaharoglou
    posted to topology graph algorithms by AbnerCYH on 2008-06-20 11:58:17 as **
  • Primal-dual approximation algorithms for integral flow and multicut in trees
    Algorithmica, Vol. 18, No. 1. (6 May 1997), pp. 3-20.
    by N Garg, V Vazirani, M Yannakakis
    posted to graph complexity algorithms by AbnerCYH on 2008-06-09 12:47:42 as **
  • On the complexity of minmax regret linear programming
    European Journal of Operational Research, Vol. 160, No. 1. (1 January 2005), pp. 227-231.
    by Igor Averbakh, Vasilij Lebedev
    posted to graph complexity algorithms by AbnerCYH on 2008-06-09 10:25:47 as **
  • Complexity of the min-max and min-max regret assignment problems
    Operations Research Letters, Vol. 33, No. 6. (November 2005), pp. 634-640.
    by Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
    posted to graph complexity algorithms by AbnerCYH on 2008-06-09 09:41:46 as **
  • A note on the minmax regret centdian location on trees
    Operations Research Letters, Vol. 36, No. 2. (March 2008), pp. 271-275.
    by Eduardo Conde
    posted to graph complexity algorithms by AbnerCYH on 2008-06-09 09:37:34 as **
  • Complexity of robust single facility location problems on networks with uncertain edge lengths
    Discrete Applied Mathematics, Vol. 127, No. 3. (1 May 2003), pp. 505-522.
    by Igor Averbakh
    posted to graph complexity automata by AbnerCYH on 2008-06-09 08:50:40 as **
  • Generalized multidimensional data mapping and query processing
    ACM Trans. Database Syst., Vol. 30, No. 3. (September 2005), pp. 661-697.
    by Rui Zhang, Panos Kalnis, Beng C Ooi, Kian-Lee Tan
    posted to graph geometries data_structure algorithms by AbnerCYH on 2008-06-06 05:27:39 as **
  • Efficient query processing on spatial networks
    (2005), pp. 200-209.
    by Jagan Sankaranarayanan, Houman Alborzi, Hanan Samet
    posted to graph geometries data_structure algorithms by AbnerCYH on 2008-06-06 05:27:25 as **
  • Distance join queries on spatial networks
    (2006), pp. 211-218.
    by Jagan Sankaranarayanan, Houman Alborzi, Hanan Samet
    posted to graph geometries data_structure algorithms by AbnerCYH on 2008-06-06 05:27:06 as **
  • Fast Network Component Analysis (FastNCA) for gene regulatory network reconstruction from microarray data.
    Bioinformatics (Oxford, England) (9 April 2008)
    by Chunqi Chang, Zhi Ding, Yeung Sam S Hung, Peter Chin Wan C Fung
    posted to graph complex biology algorithms by AbnerCYH on 2008-05-24 12:01:59 as ** along with 3 people jfr roys jyuh
  • A class of algorithms which require nonlinear time to maintain disjoint sets
    Journal of Computer and System Sciences, Vol. 18, No. 2. (April 1979), pp. 110-127.
    by Robert E Tarjan
    posted to graph algorithms by AbnerCYH on 2008-05-20 10:57:11 as **
  • Shellable graphs and sequentially Cohen-Macaulay bipartite graphs
    Journal of Combinatorial Theory, Series A, Vol. 115, No. 5. (July 2008), pp. 799-814.
    by Adam Van Tuyl, Rafael H Villarreal
    posted to topology graph algebra by AbnerCYH on 2008-05-20 05:01:41 as **
  • An annotated bibliography on guaranteed graph searching
    Theoretical Computer Science, Vol. 399, No. 3. (6 June 2008), pp. 236-245.
    by Fedor V Fomin, Dimitrios M Thilikos
    posted to graph game algorithms by AbnerCYH on 2008-05-20 04:03:18 as **
  • Digraph measures: Kelly decompositions, games, and orderings
    Theoretical Computer Science, Vol. 399, No. 3. (6 June 2008), pp. 206-219.
    by Paul Hunter, Stephan Kreutzer
    posted to graph algorithms by AbnerCYH on 2008-05-20 04:03:10 as **
  • On finding lowest common ancestors in trees
    (1973), pp. 253-265.
    by AV Aho, JE Hopcroft, JD Ullman
    posted to graph algorithms by AbnerCYH on 2008-05-19 16:19:34 as **
  • A Unified Approach to Path Problems
    J. ACM, Vol. 28, No. 3. (July 1981), pp. 577-593.
    by Robert E Tarjan
    posted to graph algorithms by AbnerCYH on 2008-05-19 15:27:12 as **
  • Fast Algorithms for Solving Path Problems
    J. ACM, Vol. 28, No. 3. (July 1981), pp. 594-614.
    by Robert E Tarjan
    posted to graph algorithms by AbnerCYH on 2008-05-19 15:14:34 as **
  • Path Diversity over Packet Switched Networks: Performance Analysis and Rate Allocation
    (14 May 2008)
    by Shervan Fashandi, Shahab O Gharan, Amir K Khandani
    posted to sys_performance graph algorithms by AbnerCYH on 2008-05-18 17:02:56 as **
  • Classes of complex networks defined by role-to-role connectivity profiles
    Nat Phys, Vol. 3, No. 1. (January 2007), pp. 63-69.
    by Roger Guimera, Marta Sales-Pardo, Luis A Amaral
    posted to graph complex biology by AbnerCYH on 2008-05-16 05:28:44 as ** along with 4 people and 1 group aalibes okarsligil jaspervoskuilen biehl Bioinformatics
  • Evolvability and hierarchy in rewired bacterial gene networks
    Nature, Vol. 452, No. 7189. (17 April 2008), pp. 840-845.
    by Mark Isalan, Caroline Lemerle, Konstantinos Michalodimitrakis, Carsten Horn, Pedro Beltrao, Emanuele Raineri, Mireia Garriga-Canut, Luis Serrano
    posted to graph complex biology by AbnerCYH on 2008-05-16 05:28:30 as ** along with 16 people and 4 groups chad_davis michaelbarton austin hryk margaritis cactus dbikard Garamonfok caseybrown biehl aalibes tmmurali dullhunk neils cmzmasek josedavid BergmanLab SynBioSys Centre de Recherches Interdisciplinaires GEB
    • ◇温馨提示◇本页的引用地址为： http://www.citeulike.org/user/AbnerCYH/tag/graph

    Result page: 1 2 3 4 5 6 7 8 Next RIS BibTeX RSS
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.