Carlos S. Subi
Stanford University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Carlos S. Subi.
SIAM Journal on Computing | 2002
Tomás Feder; Rajeev Motwani; Carlos S. Subi
We consider the problem of finding long paths and cycles in Hamiltonian graphs. The focus of our work is on sparse graphs, e.g., cubic graphs, that satisfy some property known to hold for Hamiltonian graphs, e.g., k-cyclability. We first consider the problem of finding long cycles in 3-connected cubic graphs whose edges have weights
symposium on the theory of computing | 2000
Tomás Feder; Rajeev Motwani; Carlos S. Subi
w_i\geq 0
Information Processing Letters | 2011
Tomás Feder; Carlos S. Subi
. We find cycles of weight at least
Information Processing Letters | 2013
Tomás Feder; Carlos S. Subi
{(\sum w_i^a)}^{\frac{1}{a}}
SIAM Journal on Discrete Mathematics | 2005
Tomás Feder; Carlos S. Subi
for
Information Processing Letters | 2009
Tomás Feder; Carlos S. Subi
a=\log_2 3
Discrete Applied Mathematics | 2013
Tomás Feder; Carlos S. Subi
. Based on this result, we develop an algorithm for finding a cycle of length at least
Electronic Colloquium on Computational Complexity | 2006
Tomás Feder; Carlos S. Subi
m^{(\log_3 2)/2}\approx m^{0.315}
Electronic Colloquium on Computational Complexity | 2012
Tomás Feder; Carlos S. Subi
in 3-cyclable graphs with vertices of degree at most 3 and with m edges. As a corollary of this result, for arbitrary graphs with vertices of degree at most 3 that have a cycle of length l (or, more generally, a 3-cyclable minor with degrees at most 3 and with l edges), we find a cycle of length at least
Electronic Colloquium on Computational Complexity | 2007
Tomás Feder; Carlos S. Subi
l^{(\log_3 2)/2}