Analysis of greedy algorithms on graphs with bounded degrees (English)
- New search for: Wormald, N. C.
- New search for: Wormald, N. C.
In:
DISCRETE MATHEMATICS
;
273
, 1-3
;
235-260
;
2003
-
ISSN:
- Article (Journal) / Print
-
Title:Analysis of greedy algorithms on graphs with bounded degrees
-
Contributors:Wormald, N. C. ( author )
-
Published in:DISCRETE MATHEMATICS ; 273, 1-3 ; 235-260
-
Publisher:
- New search for: Elsevier Science B.V., Amsterdam.
-
Publication date:2003-01-01
-
Size:26 pages
-
ISSN:
-
Type of media:Article (Journal)
-
Type of material:Print
-
Language:English
- New search for: 510
- Further information on Dewey Decimal Classification
-
Classification:
DDC: 510 -
Source:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Table of contents – Volume 273, Issue 1-3
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
ForewordNešetřil, Jaroslav / Noy, Marc / Guest editors Serra, Oriol et al. | 2003
- 7
-
Guest Editors| 2003
- 9
-
Extremal problems under dimension constraintsAhlswede, R. / Aydinian, H. / Khachatrian, L.H. et al. | 2003
- 23
-
Maximal antichains under dimension constraintsAhlswede, R. / Aydinian, H. / Khachatrian, L.H. et al. | 2003
- 31
-
Problems and results in extremal combinatorics—IAlon, Noga et al. | 2003
- 55
-
Vertices of degree 6 in a contraction critically 6-connected graphAndo, Kiyoshi / Kaneko, Atsushi / Kawarabayashi, Ken-ichi et al. | 2003
- 71
-
Edge splitting and connectivity augmentation in directed hypergraphsBerg, Alex R. / Jackson, Bill / Jordán, Tibor et al. | 2003
- 85
-
Chordal embeddings of planar graphsBouchitté, V. / Mazoit, F. / Todinca, I. et al. | 2003
- 103
-
Random strongly regular graphs?Cameron, Peter J. et al. | 2003
- 115
-
Distance labeling scheme and split decompositionGavoille, Cyril / Paul, Christophe et al. | 2003
- 131
-
Computing the average parallelism in trace monoidsKrob, Daniel / Mairesse, Jean / Michos, Ioannis et al. | 2003
- 163
-
On the orthogonal product of simplices and direct products of truncated Boolean latticesLeck, Uwe et al. | 2003
- 173
-
A note on random homomorphism from arbitrary graphs toLoebl, Martin / Nešetřil, Jaroslav / Reed, Bruce et al. | 2003
- 183
-
Channel assignment on graphs of bounded treewidthMcDiarmid, Colin / Reed, Bruce et al. | 2003
- 193
-
Further asymptotic size Ramsey results obtained via linear programmingPikhurko, Oleg et al. | 2003
- 203
-
Antisymmetric flows and strong oriented coloring of planar graphsS̆ámal, Robert et al. | 2003
- 211
-
Average running time analysis of an algorithm to calculate the size of the union of Cartesian productsSuzuki, Susumu / Ibaraki, Toshihide et al. | 2003
- 221
-
Geometric thickness in a gridWood, David R. et al. | 2003
- 235
-
Analysis of greedy algorithms on graphs with bounded degreesWormald, Nicholas C. et al. | 2003
- 261
-
4-Colorable 6-regular toroidal graphsYeh, Hong-Gwa / Zhu, Xuding et al. | 2003
- 275
-
Author index to volume 273| 2003
- I
-
Guide for authors| 2003
- v
-
Editorial board| 2003
- viii
-
Contents| 2003