Characterizing minimum gossip graphs on 16 vertices
Year of publication: |
1991
|
---|---|
Authors: | Labahn, Roger ; Pietsch, Christian |
Publisher: |
Bonn : Forschungsinst. für Diskrete Mathematik [u.a.] |
Subject: | Graphentheorie | Graph theory | Vertikale Integration | Vertical integration |
Extent: | 11 S. |
---|---|
Series: | Report. - Bonn : Univ., ISSN 0724-3138, ZDB-ID 1019256-6. |
Type of publication: | Book / Working Paper |
Language: | English |
Source: | ECONIS - Online Catalogue of the ZBW |
-
The maximum size of 4- and 6-cycle free bipartite graphs on m,n vertices
DeCaen, D., (1991)
-
The number of vertices of degree k in a minimally k-edge-connected graph
Cai, Mao-cheng, (1989)
-
Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem
Marín, Alfredo, (2015)
- More ...
-
Transforming scholarship in the archives through handwritten text recognition
Muehlberger, Guenter, (2019)
-
Replicability and Comprehensibility of Social Research and its Technical Implementation
Friedhoff, Stefan, (2013)
-
Kernels of minimum size gossip schemes
Labahn, Roger, (1993)
- More ...