<--- Back to Details
First PageDocument Content
Bipartite graph / Topology / Graph partition / Graph / Erdős–Faber–Lovász conjecture / Constraint graph / Graph theory / Hypergraph / NP-complete problems
Date: 2013-05-23 16:22:19
Bipartite graph
Topology
Graph partition
Graph
Erdős–Faber–Lovász conjecture
Constraint graph
Graph theory
Hypergraph
NP-complete problems

Beyond Graphs: Toward Scalable Hypergraph Analysis Systems ∗ Benjamin Heintz

Add to Reading List

Source URL: www.sigmetrics.org

Download Document from Source Website

File Size: 341,74 KB

Share Document on Facebook

Similar Documents

Edsger W. Dijkstra / Network theory / Shortest path problem / Constructible universe / Total least squares

Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook

DocID: 1xVkB - View Document

PDF Document

DocID: 1xkJU - View Document

Graph theory Po-Shen Loh June

DocID: 1vmTo - View Document

Graph theory Po-Shen Loh June

DocID: 1vhpu - View Document

Graph theory Po-Shen Loh June

DocID: 1v8nl - View Document