12,721 research outputs found
Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Log-Space
We present a logspace algorithm that constructs a canonical intersection
model for a given proper circular-arc graph, where `canonical' means that
models of isomorphic graphs are equal. This implies that the recognition and
the isomorphism problems for this class of graphs are solvable in logspace. For
a broader class of concave-round graphs, that still possess (not necessarily
proper) circular-arc models, we show that those can also be constructed
canonically in logspace. As a building block for these results, we show how to
compute canonical models of circular-arc hypergraphs in logspace, which are
also known as matrices with the circular-ones property. Finally, we consider
the search version of the Star System Problem that consists in reconstructing a
graph from its closed neighborhood hypergraph. We solve it in logspace for the
classes of proper circular-arc, concave-round, and co-convex graphs.Comment: 19 pages, 3 figures, major revisio
On the Recognition of Fuzzy Circular Interval Graphs
Fuzzy circular interval graphs are a generalization of proper circular arc
graphs and have been recently introduced by Chudnovsky and Seymour as a
fundamental subclass of claw-free graphs. In this paper, we provide a
polynomial-time algorithm for recognizing such graphs, and more importantly for
building a suitable representation.Comment: 12 pages, 2 figure
Large induced subgraphs via triangulations and CMSO
We obtain an algorithmic meta-theorem for the following optimization problem.
Let \phi\ be a Counting Monadic Second Order Logic (CMSO) formula and t be an
integer. For a given graph G, the task is to maximize |X| subject to the
following: there is a set of vertices F of G, containing X, such that the
subgraph G[F] induced by F is of treewidth at most t, and structure (G[F],X)
models \phi.
Some special cases of this optimization problem are the following generic
examples. Each of these cases contains various problems as a special subcase:
1) "Maximum induced subgraph with at most l copies of cycles of length 0
modulo m", where for fixed nonnegative integers m and l, the task is to find a
maximum induced subgraph of a given graph with at most l vertex-disjoint cycles
of length 0 modulo m.
2) "Minimum \Gamma-deletion", where for a fixed finite set of graphs \Gamma\
containing a planar graph, the task is to find a maximum induced subgraph of a
given graph containing no graph from \Gamma\ as a minor.
3) "Independent \Pi-packing", where for a fixed finite set of connected
graphs \Pi, the task is to find an induced subgraph G[F] of a given graph G
with the maximum number of connected components, such that each connected
component of G[F] is isomorphic to some graph from \Pi.
We give an algorithm solving the optimization problem on an n-vertex graph G
in time O(#pmc n^{t+4} f(t,\phi)), where #pmc is the number of all potential
maximal cliques in G and f is a function depending of t and \phi\ only. We also
show how a similar running time can be obtained for the weighted version of the
problem. Pipelined with known bounds on the number of potential maximal
cliques, we deduce that our optimization problem can be solved in time
O(1.7347^n) for arbitrary graphs, and in polynomial time for graph classes with
polynomial number of minimal separators
Graph isomorphism completeness for trapezoid graphs
The complexity of the graph isomorphism problem for trapezoid graphs has been
open over a decade. This paper shows that the problem is GI-complete. More
precisely, we show that the graph isomorphism problem is GI-complete for
comparability graphs of partially ordered sets with interval dimension 2 and
height 3. In contrast, the problem is known to be solvable in polynomial time
for comparability graphs of partially ordered sets with interval dimension at
most 2 and height at most 2.Comment: 4 pages, 3 Postscript figure
Interval Routing Schemes for Circular-Arc Graphs
Interval routing is a space efficient method to realize a distributed routing
function. In this paper we show that every circular-arc graph allows a shortest
path strict 2-interval routing scheme, i.e., by introducing a global order on
the vertices and assigning at most two (strict) intervals in this order to the
ends of every edge allows to depict a routing function that implies exclusively
shortest paths. Since circular-arc graphs do not allow shortest path 1-interval
routing schemes in general, the result implies that the class of circular-arc
graphs has strict compactness 2, which was a hitherto open question.
Additionally, we show that the constructed 2-interval routing scheme is a
1-interval routing scheme with at most one additional interval assigned at each
vertex and we an outline algorithm to calculate the routing scheme for
circular-arc graphs in O(n^2) time, where n is the number of vertices.Comment: 17 pages, to appear in "International Journal of Foundations of
Computer Science
Optimal Circular Arc Representations: Properties, Recognition, and Construction
AbstractWe investigate some properties of minimal interval and circular arc representations and give several optimal sequential and parallel recognition and construction algorithms. We show that, among other things, given ans×tinterval or circular arc representation matrix, •deciding if the representation is minimal can be done inO(logs) time withO(st/logs) EREW PRAM processors, or inO(1) time withO(st) common CRCW PRAM processors; •constructing an equivalent minimum interval representation can be done inO(log(st)) time withO(st/log(st)) EREW PRAM processors, or inO(logt/loglogt) time withO(stloglogt/logt) common CRCW PRAM processors, or inO(1) time withO(st) BSR processors; •constructing an equivalent minimal circular arc representation can be done inO(st) time
- …