1,610 research outputs found

    Parameterized Algorithms for Modular-Width

    Full text link
    It is known that a number of natural graph problems which are FPT parameterized by treewidth become W-hard when parameterized by clique-width. It is therefore desirable to find a different structural graph parameter which is as general as possible, covers dense graphs but does not incur such a heavy algorithmic penalty. The main contribution of this paper is to consider a parameter called modular-width, defined using the well-known notion of modular decompositions. Using a combination of ILPs and dynamic programming we manage to design FPT algorithms for Coloring and Partitioning into paths (and hence Hamiltonian path and Hamiltonian cycle), which are W-hard for both clique-width and its recently introduced restriction, shrub-depth. We thus argue that modular-width occupies a sweet spot as a graph parameter, generalizing several simpler notions on dense graphs but still evading the "price of generality" paid by clique-width.Comment: to appear in IPEC 2013. arXiv admin note: text overlap with arXiv:1304.5479 by other author

    Hyperbolic intersection graphs and (quasi)-polynomial time

    Full text link
    We study unit ball graphs (and, more generally, so-called noisy uniform ball graphs) in dd-dimensional hyperbolic space, which we denote by Hd\mathbb{H}^d. Using a new separator theorem, we show that unit ball graphs in Hd\mathbb{H}^d enjoy similar properties as their Euclidean counterparts, but in one dimension lower: many standard graph problems, such as Independent Set, Dominating Set, Steiner Tree, and Hamiltonian Cycle can be solved in 2O(n11/(d1))2^{O(n^{1-1/(d-1)})} time for any fixed d3d\geq 3, while the same problems need 2O(n11/d)2^{O(n^{1-1/d})} time in Rd\mathbb{R}^d. We also show that these algorithms in Hd\mathbb{H}^d are optimal up to constant factors in the exponent under ETH. This drop in dimension has the largest impact in H2\mathbb{H}^2, where we introduce a new technique to bound the treewidth of noisy uniform disk graphs. The bounds yield quasi-polynomial (nO(logn)n^{O(\log n)}) algorithms for all of the studied problems, while in the case of Hamiltonian Cycle and 33-Coloring we even get polynomial time algorithms. Furthermore, if the underlying noisy disks in H2\mathbb{H}^2 have constant maximum degree, then all studied problems can be solved in polynomial time. This contrasts with the fact that these problems require 2Ω(n)2^{\Omega(\sqrt{n})} time under ETH in constant maximum degree Euclidean unit disk graphs. Finally, we complement our quasi-polynomial algorithm for Independent Set in noisy uniform disk graphs with a matching nΩ(logn)n^{\Omega(\log n)} lower bound under ETH. This shows that the hyperbolic plane is a potential source of NP-intermediate problems.Comment: Short version appears in SODA 202

    Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable

    Full text link
    There has been significant recent interest in parallel graph processing due to the need to quickly analyze the large graphs available today. Many graph codes have been designed for distributed memory or external memory. However, today even the largest publicly-available real-world graph (the Hyperlink Web graph with over 3.5 billion vertices and 128 billion edges) can fit in the memory of a single commodity multicore server. Nevertheless, most experimental work in the literature report results on much smaller graphs, and the ones for the Hyperlink graph use distributed or external memory. Therefore, it is natural to ask whether we can efficiently solve a broad class of graph problems on this graph in memory. This paper shows that theoretically-efficient parallel graph algorithms can scale to the largest publicly-available graphs using a single machine with a terabyte of RAM, processing them in minutes. We give implementations of theoretically-efficient parallel algorithms for 20 important graph problems. We also present the optimizations and techniques that we used in our implementations, which were crucial in enabling us to process these large graphs quickly. We show that the running times of our implementations outperform existing state-of-the-art implementations on the largest real-world graphs. For many of the problems that we consider, this is the first time they have been solved on graphs at this scale. We have made the implementations developed in this work publicly-available as the Graph-Based Benchmark Suite (GBBS).Comment: This is the full version of the paper appearing in the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 201
    corecore