96 search results - page 10 / 20 » Isomorphism for Graphs of Bounded Feedback Vertex Set Number |
WEA
2005
Springer
14 years 1 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
DAM
2008
13 years 8 months ago
2008
Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
AUTOMATICA
2004
13 years 7 months ago
2004
This paper deals with feedback controller synthesis for timed event graphs in dioids, where the number of initial tokens and time delays are only known to belong to intervals. We ...
COMBINATORICA
2011
12 years 7 months ago
2011
Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn wi...
JCO
2007
13 years 7 months ago
2007
In a graph G, a vertex dominates itself and its neighbors. A subset S ⊆ V (G) is an m-tuple dominating set if S dominates every vertex of G at least m times, and an m-dominating...