Login / Signup
Feedback Vertex Set and Longest Induced Path on AT-Free Graphs.
Dieter Kratsch
Haiko Müller
Ioan Todinca
Published in:
WG (2003)
Keyphrases
</>
vertex set
weighted graph
undirected graph
random graphs
shortest path
minimum cost
upper bound
graph theoretic
maximum number
special case
bipartite graph
spanning tree
edge weights
maximum distance