Undirected graphs rearrangeable by 2-length walks.

Dominique Barth Petrisor Panaite

Published in: Networks (1998)

Keyphrases

undirected graph
directed graph
approximation algorithms
directed acyclic graph
spanning tree
graph structure
connected components
minimum cost
complex networks
markov models
vertex set
positive integer
disjoint paths
strongly connected
average degree
higher order