Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness

The notions of bounded expansion and nowhere denseness not only offer robust and general definitions of uniform sparseness of graphs, they also describe the tractability boundary for several important algorithmic questions. In this article, we study two structural properties of these graph classes that are of particular importance in this context: the property of having bounded generalized coloring numbers and the property of being uniformly quasi-wide. We provide experimental evaluations of several algorithms that approximate these parameters on real-world graphs. On the theoretical side, we provide a new algorithm for uniform quasi-wideness with polynomial size guarantees in graph classes of bounded expansion and show a lower bound indicating that the guarantees of this algorithm are close to optimal in graph classes with fixed excluded minor.

[1]  Patrice Ossona de Mendez,et al.  Distributed Domination on Graph Classes of Bounded Expansion , 2017, SPAA.

[2]  Jaroslav Nesetril,et al.  On nowhere dense graphs , 2011, Eur. J. Comb..

[3]  Blair D. Sullivan,et al.  Structural Sparsity of Complex Networks: Random Graph Models and Linear Algorithms , 2014, ArXiv.

[4]  Jérôme Kunegis,et al.  KONECT: the Koblenz network collection , 2013, WWW.

[5]  Sampo Niskanen,et al.  Cliquer user's guide, version 1.0 , 2003 .

[6]  Jaroslav Nesetril,et al.  Grad and classes with bounded expansion II. Algorithmic aspects , 2008, Eur. J. Comb..

[7]  Jure Leskovec,et al.  Signed networks in social media , 2010, CHI.

[8]  Blair D. Sullivan,et al.  Experimental Evaluation of Counting Subgraph Isomorphisms in Classes of Bounded Expansion , 2017, ArXiv.

[9]  Patrice Ossona de Mendez,et al.  On the generalised colouring numbers of graphs that exclude a fixed minor , 2015, Eur. J. Comb..

[10]  Jure Leskovec,et al.  Friendship and mobility: user movement in location-based social networks , 2011, KDD.

[11]  Rolf Niedermeier,et al.  Polynomial-time data reduction for dominating set , 2002, JACM.

[12]  Marcin Pilipczuk,et al.  Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness , 2018, SEA.

[13]  Kedar Nath Das,et al.  Heuristics to Find Maximum Independent Set: An Overview , 2011, SocProS.

[14]  Yiming Yang,et al.  Introducing the Enron Corpus , 2004, CEAS.

[15]  Ciro Cattuto,et al.  High-Resolution Measurements of Face-to-Face Contact Patterns in a Primary School , 2011, PloS one.

[16]  Arie M. C. A. Koster,et al.  Treewidth computations I. Upper bounds , 2010, Inf. Comput..

[17]  Stephan Kreutzer,et al.  Deciding first-order properties of nowhere dense graphs , 2013, STOC.

[18]  Christian Schulz,et al.  Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs , 2018, ALENEX.

[19]  S. Brenner,et al.  The structure of the nervous system of the nematode Caenorhabditis elegans. , 1986, Philosophical transactions of the Royal Society of London. Series B, Biological sciences.

[20]  Fahad Panolan,et al.  Reconfiguration on sparse graphs , 2018, J. Comput. Syst. Sci..

[21]  Stephan Kreutzer,et al.  Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes , 2016, SODA.

[22]  D. Bu,et al.  Topological structure analysis of the protein-protein interaction network in budding yeast. , 2003, Nucleic acids research.

[23]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[24]  Jaroslav Nesetril,et al.  Sparsity - Graphs, Structures, and Algorithms , 2012, Algorithms and combinatorics.

[25]  Stephan Kreutzer,et al.  Domination Problems in Nowhere-Dense Classes , 2009, FSTTCS.

[26]  BENJAMIN OYE,et al.  STABLE GRAPHS , 2017 .

[27]  Michal Pilipczuk,et al.  On the number of types in sparse graphs , 2017, LICS.

[28]  Erik D. Demaine,et al.  The Bidimensionality Theory and Its Algorithmic Applications , 2008, Comput. J..

[29]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[30]  Sebastian Siebertz,et al.  Reconfiguration on nowhere dense graph classes , 2017, Electron. J. Comb..

[31]  Bruce A. Reed,et al.  Excluding any graph as a minor allows a low tree-width 2-coloring , 2004, J. Comb. Theory, Ser. B.

[32]  Zdenek Dvorak,et al.  Constant-factor approximation of domination number in sparse graphs , 2011, ArXiv.

[33]  F. Chung,et al.  Connected Components in Random Graphs with Given Expected Degree Sequences , 2002 .

[34]  Jaroslav Nesetril,et al.  First order properties on nowhere dense structures , 2010, The Journal of Symbolic Logic.

[35]  Anne Berry,et al.  Generating All the Minimal Separators of a Graph , 1999, Int. J. Found. Comput. Sci..

[36]  Blair D. Sullivan,et al.  Treedepth Bounds in Linear Colorings , 2018, WG.

[37]  Anuj Dawar,et al.  Homomorphism Preservation on Quasi-Wide Classes , 2008, J. Comput. Syst. Sci..

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

[39]  Luc Segoufin,et al.  First-order queries on classes of structures with bounded expansion , 2018, Log. Methods Comput. Sci..

[40]  Ryan A. Rossi,et al.  The Network Data Repository with Interactive Graph Analytics and Visualization , 2015, AAAI.

[41]  Felix Reidl,et al.  Structural sparseness and complex networks , 2016 .

[42]  Azadeh Iranmehr,et al.  Trust Management for Semantic Web , 2009, 2009 Second International Conference on Computer and Electrical Engineering.

[43]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[44]  Christos Faloutsos,et al.  Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.

[45]  Erik D. Demaine,et al.  Approximation algorithms via contraction decomposition , 2007, SODA '07.

[46]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[47]  Michal Pilipczuk,et al.  Kernelization and approximation of distance-r independent sets on nowhere dense graphs , 2018, ArXiv.

[48]  Fahad Panolan,et al.  Lossy Kernels for Connected Dominating Set on Sparse Graphs , 2017, STACS.

[49]  Jure Leskovec,et al.  {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .

[50]  Donald E. Knuth,et al.  The Stanford GraphBase - a platform for combinatorial computing , 1993 .

[51]  Hisao Tamaki,et al.  Positive-instance driven dynamic programming for treewidth , 2017, Journal of Combinatorial Optimization.

[52]  Ken-ichi Kawarabayashi,et al.  Contraction decomposition in h-minor-free graphs and algorithmic applications , 2011, STOC '11.

[53]  Stephan Kreutzer,et al.  Neighborhood complexity and kernelization for nowhere dense classes of graphs , 2016, ICALP.

[54]  Hal A. Kierstead,et al.  Orderings on Graphs and Game Coloring Number , 2003, Order.

[55]  Christian Komusiewicz,et al.  The First Parameterized Algorithms and Computational Experiments Challenge , 2017, IPEC.

[56]  Stephan Kreutzer,et al.  Colouring and Covering Nowhere Dense Graphs , 2015, WG.

[57]  Ken-ichi Kawarabayashi,et al.  Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction , 2009, Algorithmica.

[58]  Zdenek Dvorak.  On distance r-dominating and 2r-independent sets in sparse graphs , 2019, J. Graph Theory.

[59]  Robin Thomas,et al.  Testing first-order properties for subclasses of sparse graphs , 2011, JACM.

[60]  Jaroslav Nesetril,et al.  Grad and classes with bounded expansion III. Restricted graph homomorphism dualities , 2008, Eur. J. Comb..

[61]  Ken-ichi Kawarabayashi,et al.  Algorithmic graph minor theory: Decomposition, approximation, and coloring , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[62]  Jaroslav Nesetril,et al.  Tree-depth, subgraph coloring and homomorphism bounds , 2006, Eur. J. Comb..

[63]  Wojciech Nadara.  Experimental evaluation of kernelization algorithms to Dominating Set , 2018, ArXiv.

[64]  A. Barabasi,et al.  The human disease network , 2007, Proceedings of the National Academy of Sciences.

[65]  Stephan Kreutzer,et al.  The Generalised Colouring Numbers on Classes of Bounded Expansion , 2016, MFCS.

[66]  Felix Reidl,et al.  Characterising Bounded Expansion by Neighbourhood Complexity , 2016, Eur. J. Comb..

[67]  Kathryn B. Laskey,et al.  Stochastic blockmodels: First steps , 1983 .

[68]  Stephan Kreutzer,et al.  Kernelization and Sparseness: the case of Dominating Set , 2014, STACS.

[69]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

[70]  Ian T. Foster,et al.  Mapping the Gnutella Network , 2002, IEEE Internet Comput..

[71]  Fahad Panolan,et al.  Reconfiguration on Sparse Graphs , 2015, WADS.

[72]  Jaroslav Nesetril,et al.  Grad and classes with bounded expansion I. Decompositions , 2008, Eur. J. Comb..

[73]  Zdenvek Dvovr'ak.  On distance r-dominating and 2r-independent sets in sparse graphs , 2017 .

[74]  Lada A. Adamic,et al.  The political blogosphere and the 2004 U.S. election: divided they blog , 2005, LinkKDD '05.

[75]  Hans L. Bodlaender.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC '93.

[76]  Fan Chung Graham,et al.  The Average Distance in a Random Graph with Given Expected Degrees , 2004, Internet Math..

[77]  F. Chung,et al.  The average distances in random graphs with given expected degrees , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[78]  Michal Pilipczuk,et al.  Polynomial bounds for centered colorings on proper minor-closed graph classes , 2018, SODA.

[79]  M. DePamphilis,et al.  HUMAN DISEASE , 1957, The Ulster Medical Journal.

[80]  Xuding Zhu,et al.  Colouring graphs with bounded generalized colouring number , 2009, Discret. Math..