A Diamond Example of an Ordinal Graph with No Infinite Paths.
James E. BaumgartnerJean A. LarsonPublished in: Ann. Pure Appl. Log. (1990)
Keyphrases
- graph representation
- graph structure
- random walk
- path length
- graph theoretic
- weighted graph
- graph partitioning
- graph based algorithm
- directed graph
- disjoint paths
- dependency graph
- graph model
- graph theory
- graph matching
- structured data
- bipartite graph
- optimal path
- adjacency matrix
- stable set
- qualitative decision theory
- graph search
- small world
- directed acyclic graph
- shortest path