<--- Back to Details
First PageDocument Content
Clique / Graph / Hypergraph / Degree / Vertex / Graph theory / Collaboration / Collaboration graph
Date: 2009-04-14 09:35:39
Clique
Graph
Hypergraph
Degree
Vertex
Graph theory
Collaboration
Collaboration graph

Add to Reading List

Source URL: www4.oakland.edu

Download Document from Source Website

File Size: 149,05 KB

Share Document on Facebook

Similar Documents

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 de nitions: vertex oloring, hromati number, edge oloring, hromati index. Coloring in nite 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