871 search results - page 38 / 175 » The vertex-cover polynomial of a graph |
147
click to vote
FOCS
2008
IEEE
16 years 17 days ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
147
click to vote
CSR
2008
Springer
15 years 8 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
154
click to vote
ESA
2008
Springer
15 years 7 months ago
2008
Springer
Given an n-node graph and a subset of k terminal nodes, the NP-hard Steiner tree problem is to compute a minimum-size tree which spans the terminals. All the known algorithms for t...
133
click to vote
DM
2006
15 years 6 months ago
2006
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that different vertices can be assigned different domination...
133
click to vote
IWOCA
2009
Springer
16 years 20 days ago
2009
Springer
We discuss various questions around partitioning a split graph into connected parts. Our main result is a polynomial time algorithm that decides whether a given split graph is full...