Estimation of cut-vertices in edge-coloured complete graphs.
Adam IdzikPublished in: Discuss. Math. Graph Theory (2005)
Keyphrases
- weighted graph
- vertex set
- undirected graph
- planar graphs
- edge weights
- random graphs
- directed graph
- accurate estimation
- adjacency matrix
- graph model
- minimum weight
- graph structure
- estimation algorithm
- approximation algorithms
- attributed graphs
- labeled graphs
- hamiltonian cycle
- graph clustering
- densely connected
- estimation accuracy
- edge information
- edge detection
- spanning tree
- estimation process
- minimum cost
- maximal cliques
- subgraph isomorphism
- graph mining
- graph theory
- graph matching
- connected components
- complex networks
- minimum spanning trees
- pairwise