Exact Algorithms for s-Club Finding and Related Problems

[1]  Bruno Courcelle,et al.  Upper bounds to the clique width of graphs , 2000, Discret. Appl. Math..

[2]  Arie M. C. A. Koster,et al.  Combinatorial Optimization on Graphs of Bounded Treewidth , 2008, Comput. J..

[3]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[4]  William R. Heller,et al.  The Planar Package Planner for System Designers , 1982, DAC 1982.

[5]  Bruno Courcelle,et al.  Graph Rewriting: An Algebraic and Logic Approach , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[6]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[7]  Paul Erdös,et al.  Maximum degree in graphs of diameter 2 , 1980, Networks.

[8]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[9]  Jan van Leeuwen,et al.  Diameter increase caused by edge deletion , 1987, J. Graph Theory.

[10]  R. M. Damerell.  On Moore graphs , 1973, Mathematical Proceedings of the Cambridge Philosophical Society.

[11]  Ján Plesník,et al.  One method for proving the impossibility of certain Moore graphs , 1974, Discret. Math..

[12]  S. M. Eker,et al.  Associative-Commutative Matching Via Bipartite Graph Matching , 1995, Comput. J..

[13]  Christian Komusiewicz,et al.  A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing , 2009, AAIM.

[14]  Bin Wu,et al.  A Parallel Algorithm for Enumerating All the Maximal k -Plexes , 2007, PAKDD Workshops.

[15]  Christian Komusiewicz,et al.  Isolation concepts for efficiently enumerating dense subgraphs , 2009, Theor. Comput. Sci..

[16]  Sergiy Butenko,et al.  Novel Approaches for Analyzing Biological Networks , 2005, J. Comb. Optim..

[17]  Michael R. Fellows,et al.  On problems without polynomial kernels , 2009, J. Comput. Syst. Sci..

[18]  Rolf Niedermeier,et al.  Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes , 2009, SEA.

[19]  Henning Fernau,et al.  Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves , 2009, STACS.

[20]  Yong Gao,et al.  A note on the hardness of graph diameter augmentation problems , 2009, ArXiv.

[21]  Bruno Courcelle,et al.  Monadic Second-Order Evaluations on Tree-Decomposable Graphs , 1993, Theor. Comput. Sci..

[22]  Rolf Niedermeier,et al.  A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems , 2009, MFCS.

[23]  Hans L. Bodlaender,et al.  A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..

[24]  Gilbert Laporte,et al.  An exact algorithm for the maximum k-club problem in an undirected graph , 1999, Eur. J. Oper. Res..

[25]  H E Stanley,et al.  Classes of small-world networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[26]  Sougata Mukherjea,et al.  On the structural properties of massive telecom call graphs: findings and implications , 2006, CIKM '06.

[27]  Anders Yeo,et al.  Kernel Bounds for Disjoint Cycles and Disjoint Paths , 2009, ESA.

[28]  Takeshi Tokuyama,et al.  Geometric algorithms for a minimum cost assignment problem , 1991, SCG '91.

[29]  Jitender S. Deogun,et al.  An Approximation Algorithm for Clustering Graphs with Dominating Diametral Path , 1997, Inf. Process. Lett..

[30]  Alan J. Hoffman,et al.  On Moore Graphs with Diameters 2 and 3 , 1960, IBM J. Res. Dev..

[31]  Stanley Milgram,et al.  An Experimental Study of the Small World Problem , 1969 .

[32]  R. Alba.  A graph‐theoretic definition of a sociometric clique† , 1973 .

[33]  David S. Johnson,et al.  The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.

[34]  Celina M. H. de Figueiredo,et al.  On the generation of bicliques of a graph , 2007, Discret. Appl. Math..

[35]  Dieter Kratsch,et al.  On treewidth approximations , 2004, Discret. Appl. Math..

[36]  Michael R. Fellows,et al.  Large Planar Graphs with Given Diameter and Maximum Degree , 1995, Discret. Appl. Math..

[37]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

[38]  Daniel Lokshtanov,et al.  New Methods in Parameterized Algorithms and Complexity , 2009 .

[39]  Chung-Lun Li,et al.  On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems , 1992, Oper. Res. Lett..

[40]  Makoto Imase,et al.  Design to Minimize Diameter on Building-Block Network , 1981, IEEE Transactions on Computers.

[41]  Stefan Kratsch,et al.  Two edge modification problems without polynomial kernels , 2009, Discret. Optim..

[42]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[43]  Lorna Stewart,et al.  Clustering Bipartite, Chordal Graphs: Complexity, Sequential, Parallel Algorithms , 1999, Discret. Appl. Math..

[44]  Stephen B. Seidman,et al.  A graph‐theoretic generalization of the clique concept* , 1978 .

[45]  J. Montoya,et al.  Small world patterns in food webs. , 2002, Journal of theoretical biology.

[46]  Daniel A. Spielman,et al.  Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.

[47]  Peter Sanders,et al.  Dynamic Highway-Node Routing , 2007, WEA.

[48]  Srinivas Pasupuleti,et al.  Detection of Protein Complexes in Protein Interaction Networks Using n-Clubs , 2008, EvoBIO.

[49]  Christophe Claramunt,et al.  Topological Analysis of Urban Street Networks , 2004 .

[50]  Sergiy Butenko,et al.  Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem , 2011, Oper. Res..

[51]  Hokky Situngkir,et al.  Small World Network of Athletes: Graph Representation of the World Professional Tennis Player , 2007 .

[52]  D. Fell,et al.  The small world of metabolism , 2000, Nature Biotechnology.

[53]  Arthur M. Farley,et al.  Partitioning trees: Matching, domination, and maximum diameter , 2004, International Journal of Computer & Information Sciences.

[54]  Bruno Courcelle,et al.  On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic , 2001, Discret. Appl. Math..

[55]  Olaf Sporns,et al.  The small world of the cerebral cortex , 2007, Neuroinformatics.

[56]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[57]  Nasrullah Memon,et al.  Structural Analysis and Destabilizing Terrorist Networks , 2006, DMIN.

[58]  H. Scheraga,et al.  Medium- and long-range interaction parameters between amino acids for predicting three-dimensional structures of proteins. , 1976, Macromolecules.

[59]  Lance Fortnow,et al.  Infeasibility of instance compression and succinct PCPs for NP , 2007, J. Comput. Syst. Sci..

[60]  Gilbert Laporte,et al.  Heuristics for finding k-clubs in an undirected graph , 2000, Comput. Oper. Res..

[61]  Sang-il Oum,et al.  Approximating rank-width and clique-width quickly , 2008, ACM Trans. Algorithms.

[62]  Udi Rotics,et al.  On the Clique-Width of Perfect Graph Classes , 1999, WG.

[63]  Bojan Mohar,et al.  On approximating the maximum diameter ratio of graphs , 2002, Discret. Math..

[64]  Udi Rotics,et al.  Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract) , 2000, Latin American Symposium on Theoretical Informatics.

[65]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[66]  Shuji Tsukiyama,et al.  A New Algorithm for Generating All the Maximal Independent Sets , 1977, SIAM J. Comput..

[67]  B. Kogut,et al.  The Small World of Germany and the Durability of National Networks , 2001, American Sociological Review.

[68]  Saket Saurabh,et al.  Incompressibility through Colors and IDs , 2009, ICALP.

[69]  Marc Noy,et al.  Computing the Tutte Polynomial on Graphs of Bounded Clique-Width , 2005, WG.

[70]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs V: On Closing the Gap Between Definability and Recognizability , 1991, Theor. Comput. Sci..

[71]  Charles Delorme,et al.  Large bipartite graphs with given degree and diameter , 1985, J. Graph Theory.

[72]  Georg Gottlob,et al.  Width Parameters Beyond Tree-width and their Applications , 2008, Comput. J..