Covering projections of graphs preserving links of vertices and edges.
Roman NedelaPublished in: Discret. Math. (1994)
Keyphrases
- weighted graph
- undirected graph
- directed edges
- edge weights
- directed graph
- strongly connected
- vertex set
- spanning tree
- random graphs
- image details
- nodes of a graph
- adjacency matrix
- attributed graphs
- labeled graphs
- subgraph isomorphism
- graph structure
- connected components
- three dimensional
- approximation algorithms
- planar graphs
- shortest path
- graph model
- graph partitioning
- bipartite graph
- real world graphs
- densely connected
- minimum weight
- random walk
- tomographic reconstruction
- maximal cliques
- minimum cost
- hamiltonian cycle
- graph mining
- directed acyclic graph
- graph matching
- graph structures
- convex sets
- graph theoretic
- graph representation
- link analysis