Finding Four-Node Subgraphs in Triangle Time Virginia Vassilevska Williams∗ Joshua R. Wang† Abstract

First Page		Document Content
Date: 2014-12-26 02:45:42 Graph theory NP-complete problems Graph operations Line graph Cograph Clique Neighbourhood Matching Hypergraph Independent set Graph Dominating set		Finding Four-Node Subgraphs in Triangle Time Virginia Vassilevska Williams∗ Joshua R. Wang† Abstract Add to Reading List Source URL: web.stanford.edu Download Document from Source Website File Size: 161,88 KB Share Document on Facebook

	The size of a hypergraph and its matching number Hao Huang∗ Po-Shen Loh† Benny Sudakov‡ DocID: 1v4qG - View Document
	Recommended Reading Efficient Parallel Sparse Matrix–Vector Multiplication Using Graph and Hypergraph Partitioning U.V. C DocID: 1uzWI - View Document
	Graph and hypergraph oloring Mi hael Krivelevi h 1. Basi denitions: vertex oloring, hromati number, edge oloring, hromati index. Coloring innite graphs, De Brujin-Erd}os theorem 2. Vertex degrees and olorings. DocID: 1upWX - View Document
	A Constraint-Based Hypergraph Partitioning Approach to Coreference Resolution Emili Sapena∗ Universitat Polit`ecnica de Catalunya Llu´ıs Padro´ ∗∗ DocID: 1ufaZ - View Document
	Technical Report BU-CE-1201 Hypergraph-Partitioning-Based Models and Methods for Exploiting Cache Locality in Sparse-Matrix Vector Multiplication Kadir Akbudak, Enver Kayaaslan and Cevdet Aykanat DocID: 1ublN - View Document