The size of a graph is reconstructible from any n-2 cards.
Paul BrownTrevor I. FennerPublished in: Discret. Math. (2018)
Keyphrases
- directed graph
- graph theory
- probabilistic model
- graph representation
- maximal cliques
- graph structure
- weighted graph
- directed acyclic graph
- graph model
- graph theoretic
- stable set
- database
- maximum clique
- bounded treewidth
- graph search
- spanning tree
- graph databases
- random walk
- low cost
- computational complexity
- search algorithm
- real time