244 search results - page 4 / 49 » Intervalizing k-Colored Graphs |
103
Voted
WG
2009
Springer
15 years 4 months ago
2009
Springer
We present a fully dynamic algorithm that maintains three different representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques...
TCS
2010
14 years 4 months ago
2010
In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...
72
Voted
CORR
2006
Springer
14 years 9 months ago
2006
Springer
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
ISAAC
2005
Springer
15 years 2 months ago
2005
Springer
Abstract. In this paper, the space requirements for the OBDD representation of certain graph classes, specifically cographs, several types of graphs with few P4s, unit interval gr...
ISAAC
2010
Springer
14 years 7 months ago
2010
Springer
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...