On relating edges in graphs without cycles of length 4.
Vadim E. LevitDavid TankusPublished in: J. Discrete Algorithms (2014)
Keyphrases
- directed graph
- weighted graph
- undirected graph
- spanning tree
- real world graphs
- directed edges
- spectral embedding
- massive graphs
- graph structure
- edge information
- graph theoretic
- directed acyclic graph
- total length
- series parallel
- edge map
- graph representation
- edge weights
- graph structures
- data sets
- random walk
- adjacency matrix
- random graphs
- fixed length
- edge detector
- graph matching
- graph databases
- graph model
- graph mining
- bipartite graph