686 search results - page 110 / 138 » Packing Cycles in Graphs |
TON
2010
14 years 8 months ago
2010
—p-Cycles have been proposed for preprovisioned 1 : N protection in optical mesh networks. Although the protection circuits are preconfigured, the detection of failures and the ...
103
click to vote
DM
2000
14 years 9 months ago
2000
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
74
Voted
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many...
RE
2006
Springer
14 years 9 months ago
2006
Springer
Aspect-oriented concepts are currently introduced in all phases of the software development life cycle. However, the complexity of interactions among different aspects and between...
WADS
2001
Springer
15 years 1 months ago
2001
Springer
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...