523 search results - page 20 / 105 » Decidability of string graphs |
126
Voted
COLOGNETWENTE
2009
15 years 4 months ago
2009
: Weakly quasi-threshold graphs form a proper subclass of the well-known class of cographs by restricting the join operation. In this paper we characterize weakly quasi-threshold g...
153
Voted
ESA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We prove that for every graph H, there exists a polynomial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological min...
110
Voted
WG
2005
Springer
15 years 9 months ago
2005
Springer
To decide whether a line graph (hence a claw-free graph) of maximum degree five admits a stable cutset has been proven to be an NP-complete problem. The same result has been known...
129
click to vote
TCS
2008
15 years 3 months ago
2008
Let R be a resolution refutation, given as a sequence of clauses without explicit description of the underlying dag. Then, it is NPcomplete to decide whether R is a regular resolu...
126
click to vote
CAV
2008
Springer
15 years 5 months ago
2008
Springer
We show how to view certain subclasses of (single-pushout) graph transformation systems as well-structured transition systems, which leads to decidability of the covering problem v...