-edge trees in graphs of restricted vertex degrees.
Alexander K. KelmansPublished in: J. Graph Theory (2007)
Keyphrases
- undirected graph
- edge weights
- vertex set
- attributed graphs
- weighted graph
- directed graph
- labeled graphs
- spanning tree
- connected components
- complex networks
- graph matching
- graph structure
- decision trees
- strongly connected
- approximation algorithms
- directed acyclic graph
- random graphs
- minimum cost
- tree structure
- minimum weight
- tree structured data
- maximum cardinality
- edge detection
- leaf nodes
- edge information
- graph model
- hamiltonian cycle
- average degree
- graph clustering
- tree structures
- bipartite graph
- labeled trees
- minimum spanning trees
- shortest path