Algorithms for finding a fundamental set of cycles for an undirected linear graph.
C. C. GotliebDerek G. CorneilPublished in: Commun. ACM (1967)
Keyphrases
- directed graph
- graph theory
- weighted graph
- polynomial time complexity
- learning algorithm
- computational complexity
- undirected graph
- strongly connected
- optimization problems
- computational cost
- equivalence classes
- random walk
- structured data
- linear constraints
- linear space
- maximum flow
- dependency graph
- feature selection