On the Convexity of Paths of Length Two in Undirected Graphs.
Carmen C. CentenoMitre Costa DouradoJayme Luiz SzwarcfiterPublished in: Electron. Notes Discret. Math. (2009)
Keyphrases
- undirected graph
- disjoint paths
- directed graph
- directed acyclic graph
- approximation algorithms
- path length
- shortest path
- random graphs
- markov models
- complex networks
- graph structure
- minimum cost
- spanning tree
- connected components
- multicommodity flow
- binary images
- undirected graphical models
- strongly connected
- vertex set
- average degree
- np hard
- graph structures
- image processing
- social networks