Results for:
"
Hypergraphia
" in Documents
- This document in subdirectoryRS/99/49/ An Approximation Algorithm for ...
- Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS Re...
-
Rating:
Views: (1005)
Pages: ()
Uploaded: 13-05-09
- Hierarchical reduction and partition of hypergraph.
- In this paper, a hierarchical reduction method of hypergraphs is proposed. A macro-vertex in a reduced hypergraph corresponds to an edge of the original hypergraph, and thus a reduced hypergraph can p...
-
Rating:
Views: ()
Pages: ()
Uploaded: 1996-1-1
- The hypergraph regularity method and its applications.
- Szemeredi's regularity lemma asserts that every graph can be decomposed into relatively few random-like subgraphs. This random-like behavior enables one to find and enumerate subgraphs of a given isom...
-
Rating:
Views: ()
Pages: ()
Uploaded: 2005-5-28
- Deterministic Hypergraph Coloring and Its Applications 1998 6 citation...
- Given a hypergraph and a set of colors, we want to find a vertex coloring to minimize the size of any monochromatic set in an edge. We give deterministic polynomial time approximation algorithms with ...
-
Rating:
Views: (1003)
Pages: ()
Uploaded: 13-05-09
- Nearly-Perfect Hypergraph Packing is in NC 1996
- Answering a question of Rodl and Thoma, we show that the Nibble Algorithm for finding a collection of disjoint edges covering almost all vertices in an almost regular, uniform hypergraph with negligib...
-
Rating:
Views: (1012)
Pages: ()
Uploaded: 13-05-09
- Deterministic Hypergraph Coloring and Its Applications 1998 6 citation...
- Given a hypergraph and a set of colors, we want to find a vertex coloring to minimize the size of any monochromatic set in an edge. We give deterministic polynomial time approximation algorithms with ...
-
Rating:
Views: (1006)
Pages: ()
Uploaded: 13-05-09
- Deterministic Hypergraph Coloring and Its Applications 1998 6 citation...
- Given a hypergraph and a set of colors, we want to find a vertex coloring to minimize the size of any monochromatic set in an edge. We give deterministic polynomial time approximation algorithms with ...
-
Rating:
Views: (1007)
Pages: ()
Uploaded: 13-05-09
- Modelling programs by the notion of hypergraph
- Abstract Programs can be modelled by hypergraphs where the nodes of the hypergraph represent programming units, such as statements or operands/operators, and the edges contain units which are related...
-
Rating:
Views: (2005)
Pages: (0)
Uploaded: Publication Date: Mar 1989