102
Voted
WG
2007
Springer
15 years 6 months ago
2007
Springer
A circular-arc model M = (C, A) is a circle C together with a collection A of arcs of C. If no arc is contained in any other then M is a proper circular-arc model, if every arc has...
87
Voted
WG
2007
Springer
15 years 6 months ago
2007
Springer
NLC-width is a variant of clique-width with many application in graph algorithmic. This paper is devoted to graphs of NLC-width two. After giving new structural properties of the ...
95
Voted
WG
2007
Springer
15 years 6 months ago
2007
Springer
84
Voted
WG
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The computation of all minimal transversals of a given hypergraph in output-polynomial time is a long standing open question known as the transversal hypergraph generatio...
87
Voted
WG
2007
Springer
15 years 6 months ago
2007
Springer
WG
2007
Springer
15 years 6 months ago
2007
Springer
We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...
77
Voted
WG
2007
Springer
15 years 6 months ago
2007
Springer
72
Voted
WG
2007
Springer
15 years 6 months ago
2007
Springer
80
Voted
WG
2007
Springer
15 years 6 months ago
2007
Springer
For a 3-colourable graph G, the 3-colour graph of G, denoted C3(G), is the graph with node set the proper vertex 3-colourings of G, and two nodes adjacent whenever the correspondi...
101
Voted
WG
2007
Springer
15 years 6 months ago
2007
Springer
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...