Packings of graphs and applications to computational complexity.
Béla BollobásStephen E. EldridgePublished in: J. Comb. Theory, Ser. B (1978)
Keyphrases
- computational complexity
- graph matching
- special case
- np complete
- low complexity
- graph representation
- graph theoretic
- database
- graph theory
- random graphs
- directed graph
- computational efficiency
- rate distortion
- computationally efficient
- computational cost
- information systems
- graph databases
- adjacency matrix
- packing problem
- structured objects
- graph model
- graph structure
- bipartite graph
- feature selection
- real time