Packing vertices and edges in random regular graphs.
Mihalis BeisWilliam DuckworthMichele ZitoPublished in: Random Struct. Algorithms (2008)
Keyphrases
- weighted graph
- undirected graph
- edge weights
- directed edges
- directed graph
- vertex set
- spanning tree
- adjacency matrix
- random graphs
- graph structure
- labeled graphs
- directed acyclic graph
- densely connected
- graph partitioning
- minimum weight
- subgraph isomorphism
- minimum cost
- connected components
- approximation algorithms
- attributed graphs
- shortest path
- planar graphs
- graph clustering
- strongly connected
- graph model
- bipartite graph
- connected subgraphs
- hamiltonian cycle
- real world graphs
- average degree
- graph structures
- minimum spanning tree
- graph matching
- random walk
- multiscale
- strip packing
- spectral embedding
- packing problem
- data objects
- complex networks
- edge detection