Computing the pathwidth of directed graphs with small vertex cover.

Yasuaki Kobayashi

Published in: Inf. Process. Lett. (2015)

Keyphrases

directed graph
vertex cover
brute force search
approximation algorithms
random walk
undirected graph
planar graphs
partial order
directed acyclic graph
np hard
precedence constraints
optimality criterion
graph structure