- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 211 to 220 of 4172 (0.031 seconds)| 211 |
Small Ramsey numbersIshii, Minoru, 1945- January 1985 (has links)
No description available.
|
| 212 |
A semi-strong perfect graph theorem /Reed, Bruce. January 1986 (has links)
No description available.
|
| 213 |
On graph approximation heuristics : an application to vertex cover on planar graphsMeek, Darrin Leigh 08 1900 (has links)
No description available.
|
| 214 |
Zone formation problems on embedded planar graphsStutzman, Bryan R. 08 1900 (has links)
No description available.
|
| 215 |
Constrained graph partitioning : decomposition, polyhedral structure and algorithmsMehrotra, Anuj 12 1900 (has links)
No description available.
|
| 216 |
Graph approximation : issues and complexityHorton, Steven Bradish 05 1900 (has links)
No description available.
|
| 217 |
The Bernoulli salesmanWhitaker, Linda M. 08 1900 (has links)
No description available.
|
| 218 |
On partial completion problemsEaston, Todd William 08 1900 (has links)
No description available.
|
| 219 |
Planar covers of graphs : Negami's conjectureHliněnʹy, Petr 08 1900 (has links)
No description available.
|
| 220 |
Linear algorithms for graphs of tree-width at most fourSanders, Daniel Preston 08 1900 (has links)
No description available.
|
Page generated in 0.0381 seconds