On the cycle polytope of a directed graph and its relaxations.

Egon Balas Rüdiger Stephan

Published in: Networks (2009)

Keyphrases

directed graph
random walk
semidefinite
graph structure
linear programming
undirected graph
lower bound
strongly connected
directed acyclic graph
shortest path problem
np hard
special case
web graph
sensor networks
graphical models
graph structures
maximum flow
graph properties
directed edges