Sciweavers

618 search results - page 4 / 124
» Short cycle connectivity
Sort
View
97
Voted
CPC
2010
88views more  CPC 2010»
14 years 10 months ago
Directed Graphs Without Short Cycles
Jacob Fox, Peter Keevash, Benny Sudakov
CN
2004
98views more  CN 2004»
15 years 16 days ago
Simulation analysis of RED with short lived TCP connections
Several objectives have been identified in developing the random early drop (RED): decreasing queueing delay, increasing throughput, and increasing fairness between short and long...
Eitan Altman, Tania Jiménez
94
Voted
BMCBI
2004
73views more  BMCBI 2004»
15 years 16 days ago
Use of a structural alphabet for analysis of short loops connecting repetitive structures
Background: Because loops connect regular secondary structures, analysis of the former depends directly on the definition of the latter. The numerous assignment methods, however, ...
Laurent Fourrier, Cristina Benros, Alexandre G. de...
78
Voted
JGT
2008
59views more  JGT 2008»
15 years 20 days ago
Pebbling and optimal pebbling in graphs
Given a distribution of pebbles on the vertices of a graph G, a pebbling move takes two pebbles from one vertex and puts one on a neighboring vertex. The pebbling number (G) is th...
David P. Bunde, Erin W. Chambers, Daniel W. Cranst...
STOC
2010
ACM
274views Algorithms» more  STOC 2010»
15 years 10 months ago
Odd Cycle Packing
We study the ratio between the minimum size of an odd cycle vertex transversal and the maximum size of a collection of vertex-disjoint odd cycles in a planar graph. We show that th...
Ken-ichi Kawarabayashi and Bruce Reed