Login / Signup
Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth.
Bernardetta Addis
Marco Di Summa
Andrea Grosso
Published in:
Discret. Appl. Math. (2013)
Keyphrases
</>
bounded treewidth
undirected graph
highly parallelizable
learning algorithm
computational complexity
worst case
directed graph
strongly connected
fixed parameter tractable
disjoint paths
decision makers
random walk
decision problems
directed acyclic graph
minimum cost
spanning tree
database systems
database