9532 search results - page 115 / 1907 » Logic, Graphs, and Algorithms |
DAM
2008
14 years 11 months ago
2008
We present a polynomial time algorithm to compute a minimum (weight) feedback vertex set for AT-free graphs, and extending this approach we obtain a polynomial time algorithm for ...
101
click to vote
COMBINATORICS
2002
14 years 11 months ago
2002
We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm,...
102
click to vote
CIAC
2010
Springer
14 years 8 months ago
2010
Springer
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a -graph for -graphs being one ...
111
click to vote
ICCS
2004
Springer
15 years 4 months ago
2004
Springer
An important part of the computer science is focused on the links that can be established between group theory and graph theory. Cayley graphs can establish such a link but meet so...
IPL
2008
14 years 11 months ago
2008
Given an arbitrary graph G = (V, E) and a proper interval graph H = (V, F) with E F we say that H is a proper interval completion of G. The graph H is called a minimal proper inte...