8,553 research outputs found

    On the tractability of some natural packing, covering and partitioning problems

    Get PDF
    In this paper we fix 7 types of undirected graphs: paths, paths with prescribed endvertices, circuits, forests, spanning trees, (not necessarily spanning) trees and cuts. Given an undirected graph G=(V,E)G=(V,E) and two "object types" A\mathrm{A} and B\mathrm{B} chosen from the alternatives above, we consider the following questions. \textbf{Packing problem:} can we find an object of type A\mathrm{A} and one of type B\mathrm{B} in the edge set EE of GG, so that they are edge-disjoint? \textbf{Partitioning problem:} can we partition EE into an object of type A\mathrm{A} and one of type B\mathrm{B}? \textbf{Covering problem:} can we cover EE with an object of type A\mathrm{A}, and an object of type B\mathrm{B}? This framework includes 44 natural graph theoretic questions. Some of these problems were well-known before, for example covering the edge-set of a graph with two spanning trees, or finding an ss-tt path PP and an s′s'-t′t' path P′P' that are edge-disjoint. However, many others were not, for example can we find an ss-tt path P⊆EP\subseteq E and a spanning tree T⊆ET\subseteq E that are edge-disjoint? Most of these previously unknown problems turned out to be NP-complete, many of them even in planar graphs. This paper determines the status of these 44 problems. For the NP-complete problems we also investigate the planar version, for the polynomial problems we consider the matroidal generalization (wherever this makes sense)

    A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem

    Full text link
    The clustered planarity problem (c-planarity) asks whether a hierarchically clustered graph admits a planar drawing such that the clusters can be nicely represented by regions. We introduce the cd-tree data structure and give a new characterization of c-planarity. It leads to efficient algorithms for c-planarity testing in the following cases. (i) Every cluster and every co-cluster (complement of a cluster) has at most two connected components. (ii) Every cluster has at most five outgoing edges. Moreover, the cd-tree reveals interesting connections between c-planarity and planarity with constraints on the order of edges around vertices. On one hand, this gives rise to a bunch of new open problems related to c-planarity, on the other hand it provides a new perspective on previous results.Comment: 17 pages, 2 figure

    Approximating the Spectrum of a Graph

    Full text link
    The spectrum of a network or graph G=(V,E)G=(V,E) with adjacency matrix AA, consists of the eigenvalues of the normalized Laplacian L=I−D−1/2AD−1/2L= I - D^{-1/2} A D^{-1/2}. This set of eigenvalues encapsulates many aspects of the structure of the graph, including the extent to which the graph posses community structures at multiple scales. We study the problem of approximating the spectrum λ=(λ1,…,λ∣V∣)\lambda = (\lambda_1,\dots,\lambda_{|V|}), 0≤λ1,≤…,≤λ∣V∣≤20 \le \lambda_1,\le \dots, \le \lambda_{|V|}\le 2 of GG in the regime where the graph is too large to explicitly calculate the spectrum. We present a sublinear time algorithm that, given the ability to query a random node in the graph and select a random neighbor of a given node, computes a succinct representation of an approximation λ~=(λ~1,…,λ~∣V∣)\widetilde \lambda = (\widetilde \lambda_1,\dots,\widetilde \lambda_{|V|}), 0≤λ~1,≤…,≤λ~∣V∣≤20 \le \widetilde \lambda_1,\le \dots, \le \widetilde \lambda_{|V|}\le 2 such that ∥λ~−λ∥1≤ϵ∣V∣\|\widetilde \lambda - \lambda\|_1 \le \epsilon |V|. Our algorithm has query complexity and running time exp(O(1/ϵ))exp(O(1/\epsilon)), independent of the size of the graph, ∣V∣|V|. We demonstrate the practical viability of our algorithm on 15 different real-world graphs from the Stanford Large Network Dataset Collection, including social networks, academic collaboration graphs, and road networks. For the smallest of these graphs, we are able to validate the accuracy of our algorithm by explicitly calculating the true spectrum; for the larger graphs, such a calculation is computationally prohibitive. In addition we study the implications of our algorithm to property testing in the bounded degree graph model

    Partitioning Perfect Graphs into Stars

    Full text link
    The partition of graphs into "nice" subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into same-size stars, a problem known to be NP-complete even for the case of stars on three vertices. We perform a thorough computational complexity study of the problem on subclasses of perfect graphs and identify several polynomial-time solvable cases, for example, on interval graphs and bipartite permutation graphs, and also NP-complete cases, for example, on grid graphs and chordal graphs.Comment: Manuscript accepted to Journal of Graph Theor
    • …
    corecore