4865 search results - page 162 / 973 » The Complexity of Graph Connectivity |
115
Voted
COMBINATORICS
1999
15 years 3 months ago
1999
Abstract. Ehrenborg and Steingr
149
Voted
WG
2009
Springer
15 years 10 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...
129
Voted
COMPGEOM
2004
ACM
15 years 8 months ago
2004
ACM
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...
136
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
128
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
The independence numbers of powers of graphs have been long studied, under several definitions of graph products, and in particular, under the strong graph product. We show that t...