Generating all the Acyclic Orientations of an Undirected Graph.

Valmir Carneiro Barbosa Jayme Luiz Szwarcfiter

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

Keyphrases

undirected graph
approximation algorithms
directed graph
np hard
minimum cost
spanning tree
directed acyclic graph
connected components
complex networks
positive integer
graph structure
random graphs
strongly connected
adjacency matrix
np complete
social networks
database schemes
maximum cardinality