| |
Browse All Reviews > Mathematics Of Computing (G) > Discrete Mathematics (G.2) > Graph Theory (G.2.2) > Hypergraphs (G.2.2...)
|
|
 |
|
|
| |
|
|
| |
1-6 of 6
Reviews about "Hypergraphs (G.2.2...)":
|
Date Reviewed |
| |
Efficient matching for column intersection graphs
Auer B., Bisseling R. Journal of Experimental Algorithmics 191.1-1.22, 2014. Type: Article
Graph partitioning and hypergraph partitioning have been used extensively in applications ranging from very-large-scale integration (VLSI) to portioning of data in parallel and distributed applications. Hypergraph and graph partitionin...
|
Jul 30 2014 |
| |
Hypergraph theory: an introduction
Bretto A., Springer Publishing Company, Incorporated, Cham, Switzerland, 2013. 132 pp. Type: Book (978-3-319000-79-4)
As the title suggests, this book addresses the mathematics and theory of hypergraphs. The target audience includes graduate students and researchers with an interest in math and computer science (CS)....
|
Jan 28 2014 |
| |
Algebraic hierarchical graph transformation
Palacz W. Journal of Computer and System Sciences 68(3): 497-520, 2004. Type: Article
The double-pushout approach to graph transformations, based on notions of category theory, has been applied to hierarchical graphs, the nodes of which may contain subgraphs. Palacz takes an interesting step forward, allowing edges to c...
|
Apr 27 2005 |
| |
Fault-tolerant cycle-emebedding of crossed cubes
Yang M., Li T., Tan J., Hsu L. Information Processing Letters 88(4): 149-154, 2003. Type: Article
Taking into account that failures in both links and nodes are inevitable in a network, and that the fault-tolerant capacity of a network constitutes a crucial issue in parallel computing, this paper studies and presents analytical resu...
|
Jun 9 2004 |
| |
On minimizing the maximum congestion for weighted hypergraph embedding in a cycle
Lee S., Ho H. Information Processing Letters 87(5): 271-275, 2003. Type: Article
The hypergraph embedding problem is to embed m hyperedges as adjacent paths of an n-vertex cycle, such that the maximum number of adjacent paths over any physical length of the cycle is minimized [...
|
Oct 22 2003 |
| |
Closures of database hypergraphs
Saccà D. Journal of the ACM 32(4): 774-803, 1985. Type: Article
In this paper, the author studies the close relationship that exists between a database schema and a hypergraph. Many of the results in this paper are closely related to the results in [1] and [2]. The main results of the paper concern...
|
Apr 1 1987 |
| |
|
|
| |
|
|
