A Linear-time Algorithm for Computing the Intersection of All Odd Cycles in a Graph.
Leizhen CaiBaruch SchieberPublished in: Discret. Appl. Math. (1997)
Keyphrases
- homology generators
- random walk
- graph model
- structured data
- weighted graph
- graph theoretic
- steiner tree
- directed graph
- graph based algorithm
- directed acyclic graph
- graph representation
- minimum cost
- stable set
- planar graphs
- dependency graph
- edge weights
- spanning tree
- database
- graph matching
- graphical models
- multi agent systems
- neural network