Path homomorphisms, graph colorings, and boolean matrices.
Jaroslav NesetrilClaude TardifPublished in: J. Graph Theory (2010)
Keyphrases
- graph theory
- graph model
- shortest path problem
- solution path
- shortest path
- graph representation
- weighted graph
- boolean functions
- graph matching
- graph structure
- directed acyclic graph
- directed graph
- real valued
- connected components
- graph coloring
- finding the shortest path
- spanning tree
- path length
- root node
- edge weights
- low rank and sparse
- random walk
- finite state automata
- graph based algorithm
- singular value decomposition
- graph databases
- bipartite graph