Skip to search formSkip to main contentSemantic Scholar

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2010

Highly Cited

2010

We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are $W[1]$-hard parameterized by clique-width. It was an… Expand

Is this relevant?

Highly Cited

2009

Highly Cited

2009

Clique-width is a graph parameter that measures in a certain sense the complexity of a graph. Hard graph problems (e.g., problems… Expand

Is this relevant?

Highly Cited

2008

Highly Cited

2008

Rank-width was defined by Oum and Seymour [2006] to investigate clique-width. They constructed an algorithm that either outputs a… Expand

Is this relevant?

Highly Cited

2008

Highly Cited

2008

We study algorithms for @?SAT and its generalized version @?GENSAT, the problem of computing the number of satisfying assignments… Expand

Is this relevant?

Highly Cited

2006

Highly Cited

2006

We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric sub-modular functions, and give two… Expand

Is this relevant?

Highly Cited

2001

Highly Cited

2001

We show that many non-MSO1 NP-hard graph problems can be solved in polynomial time on clique-width and NLC-width bounded graphs… Expand

Is this relevant?

Highly Cited

2000

Highly Cited

2000

Abstract Hierarchical decompositions of graphs are interesting for algorithmic purposes. Many NP complete problems have linear… Expand

Is this relevant?

Highly Cited

2000

Highly Cited

2000

Abstract. Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical… Expand

Is this relevant?

Highly Cited

2000

Highly Cited

2000

We proof that every graph of clique-width k which does not contain the complete bipartite graph Kn,n for some n > 1 as a subgraph… Expand

Is this relevant?

Highly Cited

1998

Highly Cited

1998

Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical… Expand

Is this relevant?