Sciweavers

265 search results - page 44 / 53
» The independence number in graphs of maximum degree three
Sort
View
BMCBI
2007
80views more  BMCBI 2007»
14 years 9 months ago
A network perspective on the topological importance of enzymes and their phylogenetic conservation
Background: A metabolic network is the sum of all chemical transformations or reactions in the cell, with the metabolites being interconnected by enzyme-catalyzed reactions. Many ...
Wei-chung Liu, Wen-hsien Lin, Andrew J. Davis, Fer...
70
Voted
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
15 years 10 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
PODC
2010
ACM
15 years 1 months ago
A new technique for distributed symmetry breaking
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
Johannes Schneider, Roger Wattenhofer
DM
2002
186views more  DM 2002»
14 years 9 months ago
Coloring Eulerian triangulations of the projective plane
A simple characterization of the 3, 4, or 5-colorable Eulerian triangulations of the projective plane is given. Key words: Projective plane, triangulation, coloring, Eulerian grap...
Bojan Mohar
NETWORKS
2007
14 years 9 months ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu