Finite undirected graphs which are not reconstructible from their large cardinality subgraphs.
Václav NýdlPublished in: Discret. Math. (1992)
Keyphrases
- undirected graph
- directed graph
- graph structures
- directed acyclic graph
- approximation algorithms
- spanning tree
- minimum cost
- graph structure
- connected components
- positive integer
- random graphs
- data structure
- graph mining
- complex networks
- disjoint paths
- multicommodity flow
- graph databases
- level set
- hidden markov models
- image segmentation
- weighted graph
- np hard