Sciweavers

723 search results - page 9 / 145
» On the hyperbolicity constant in graphs
Sort
View
RSA
2008
58views more  RSA 2008»
13 years 6 months ago
The isoperimetric constant of the random graph process
Itai Benjamini, Simi Haber, Michael Krivelevich, E...
JCT
2010
56views more  JCT 2010»
13 years 5 months ago
Growth constants of minor-closed classes of graphs
Olivier Bernardi, Marc Noy, Dominic Welsh
FOCS
1999
IEEE
13 years 11 months ago
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
Jon Feldman, Matthias Ruhl
TRIER
2002
13 years 7 months ago
Polynomial Constants are Decidable
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs w...
Markus Müller-Olm, Helmut Seidl