Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs.
Surender BaswanaShahbaz KhanPublished in: ICALP (1) (2014)
Keyphrases
- undirected graph
- spanning tree
- graph structure
- depth first search
- directed graph
- approximation algorithms
- undirected graphical models
- tree structure
- directed acyclic graph
- disjoint paths
- minimum cost
- multicommodity flow
- random graphs
- connected components
- complex networks
- vertex set
- graphical models
- graph structures
- pairwise
- conditional random fields
- np hard
- special case
- strongly connected
- positive integer
- data structure