Some Reduction Procedure for Computing Pathwidth of Undirected Graphs.

Masataka Ikeda Hiroshi Nagamochi

Published in: IEICE Trans. Inf. Syst. (2015)

Keyphrases

undirected graph
directed graph
directed acyclic graph
approximation algorithms
spanning tree
higher order
connected components
average degree
disjoint paths
computational complexity
state space
random variables
complex networks
graph structure
strongly connected