Constructing graphs with several pseudosimilar vertices or edges.
Josef LauriPublished in: Discret. Math. (2003)
Keyphrases
- weighted graph
- undirected graph
- edge weights
- directed edges
- directed graph
- vertex set
- spanning tree
- adjacency matrix
- random graphs
- shortest path
- graph partitioning
- minimum weight
- graph structure
- labeled graphs
- bipartite graph
- attributed graphs
- graph model
- planar graphs
- approximation algorithms
- subgraph isomorphism
- maximum cardinality
- densely connected
- connected components
- graph clustering
- minimum cost
- data objects
- maximum matching
- directed acyclic graph
- average degree
- graph representation
- massive graphs
- real world graphs
- minimum spanning tree
- image processing
- graph matching
- complex networks
- pairwise