Sciweavers

1199 search results - page 2 / 240
» Graph Theory
Sort
View
FOCS
2005
IEEE
13 years 9 months ago
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ic...
AML
1999
135views more  AML 1999»
13 years 3 months ago
Random graphs in the monadic theory of order
We continue the works of Gurevich-Shelah and Lifsches-Shelah by showing that it is consistent with ZFC that the first-order theory of random graphs is not interpretable in the mon...
Shmuel Lifsches, Saharon Shelah
ARSCOM
2006
202views more  ARSCOM 2006»
13 years 3 months ago
Domination in Planar Graphs with Small Diameter II
MacGillivray and Seyffarth (J. Graph Theory 22 (1996), 213
Michael Dorfling, Wayne Goddard, Michael A. Hennin...
MFCS
2004
Springer
13 years 9 months ago
The Bidimensional Theory of Bounded-Genus Graphs
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitr...
ICCS
2004
Springer
13 years 9 months ago
Graphical and Computational Representation of Groups
An important part of the computer science is focused on the links that can be established between group theory and graph theory. Cayley graphs can establish such a link but meet so...
Alain Bretto, Luc Gillibert