Asymptotic Enumeration of Tournaments with a Given Score Sequence Containing a Specified Digraph (Englisch)
- Neue Suche nach: Gao, Z.
- Neue Suche nach: McKay, B. D.
- Neue Suche nach: Wang, X.
- Neue Suche nach: Gao, Z.
- Neue Suche nach: McKay, B. D.
- Neue Suche nach: Wang, X.
In:
RANDOM STRUCTURES AND ALGORITHMS
;
16
;
47-57
;
2000
-
ISSN:
- Aufsatz (Zeitschrift) / Print
-
Titel:Asymptotic Enumeration of Tournaments with a Given Score Sequence Containing a Specified Digraph
-
Beteiligte:
-
Erschienen in:RANDOM STRUCTURES AND ALGORITHMS ; 16 ; 47-57
-
Verlag:
- Neue Suche nach: JOHN WILEY & SONS, INC.
-
Erscheinungsdatum:01.01.2000
-
Format / Umfang:11 pages
-
ISSN:
-
Medientyp:Aufsatz (Zeitschrift)
-
Format:Print
-
Sprache:Englisch
- Neue Suche nach: 510
- Weitere Informationen zu Dewey Decimal Classification
-
Klassifikation:
DDC: 510 -
Datenquelle:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Inhaltsverzeichnis – Band 16
Zeige alle Jahrgänge und Ausgaben
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
Ten Years!Karonski, Michal et al. | 2000
- 4
-
Improved Bounds and Algorithms for Hypergraph 2-ColoringRadhakrishnan, Jaikumar et al. | 2000
- 33
-
Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential ModelCooper, Colin et al. | 2000
- 47
-
Asymptotic Enumeration of Tournaments with a Given Score Sequence Containing a Specified DigraphGao, Zhicheng et al. | 2000
- 58
-
Dependent Percolation and Colliding Random WalksWinkler, Peter et al. | 2000
- 85
-
How to Couple from the Past Using a Read-Once Source of RandomnessWilson, David Bruce et al. | 2000
- 115
-
Author Index for Volumes 1-15| 2000
- 131
-
Lollipop Graphs Are Extremal for Commute TimesJonasson, Johan et al. | 2000
- 143
-
Energy of Flows on Z2 Percolation ClustersHoffman, Christopher et al. | 2000
- 156
-
Random Intersection Graphs when mFill, James Allen et al. | 2000
- 156
-
Random Intersection Graphs when m = Omega(n): An Equivalence Theorem Relating the Evolution of the G(n, m, p) and G(n, p) ModelsFill, J. A. / Scheinerman, E. R. / Singer-Cohen, K. B. et al. | 2000
- 177
-
The Length of Random Subsets of Boolean LatticesKohayakawa, Y. et al. | 2000
- 195
-
Finding and Certifying a Large Hidden Clique in a Semirandom GraphFeige, Uriel et al. | 2000
- 209
-
On the Rank of Random MatricesCooper, C. et al. | 2000
- 233
-
On Random Orderings of Variables for Parity Ordered Binary Decision DiagramsSavicky, Petr et al. | 2000
- 240
-
Average-Case Analyses of First Fit and Random Fit Bin PackingAlbers, Susanne et al. | 2000
- 260
-
On Triangle-Free Random GraphsLuczak, Tomasz et al. | 2000
- 277
-
A Sharp Concentration Inequality with ApplicationsBoucheron, Stéphane et al. | 2000
- 293
-
MODp-Tests, Almost Independence and Small Probability SpacesBertram-Kretzberg, Claudia et al. | 2000
- 314
-
Polynomial Time Approximation of Dense Weighted Instances of MAX-CUTFernandez de la Vega, W. et al. | 2000
- 333
-
Percolation in a Dependent Random EnvironmentJonasson, Johan et al. | 2000
- 344
-
On the Concentration of Multivariate Polynomials with Small ExpectationVu, Van H. et al. | 2000
- 364
-
Degrees and Choice NumbersAlon, Noga et al. | 2000
- 369
-
Hamilton Cycles in Random Graphs and Directed GraphsCooper, Colin et al. | 2000
- 403
-
Author Index to Volume 16| 2000
-
Volume Contents for Volume 16| 2000
-
Volume Contents for Volumes 1-15| 2000