On A Graph Formalism for Ordered Edges.
Maarten de MolArend RensinkPublished in: Electron. Commun. Eur. Assoc. Softw. Sci. Technol. (2010)
Keyphrases
- directed graph
- weighted graph
- spanning tree
- directed acyclic graph
- undirected graph
- edge weights
- random walk
- graph structure
- nodes of a graph
- vertex set
- graph representation
- directed edges
- graph model
- knowledge representation
- maximum matching
- spectral embedding
- bipartite graph
- strongly connected
- graph theory
- edge information
- strongly connected components
- shortest path
- connected components
- graph structures
- dependency graph
- edge map
- graph based algorithm
- graph clustering
- graph matching
- densely connected
- graphical representation
- graph theoretic
- edge detector