Sciweavers

26 search results - page 4 / 6
» wg 2007
Sort
View
72
Voted
FGCN
2007
IEEE
15 years 3 months ago
An Evalulation of the Pool Maintenance Overhead in Reliable Server Pooling Systems
Reliable Server Pooling (RSerPool) is a protocol framework for server redundancy and session failover, currently still under standardization by the IETF RSerPool WG. An important ...
Thomas Dreibholz, Erwin P. Rathgeb
WG
2007
Springer
15 years 3 months ago
Minimum-Weight Cycle Covers and Their Approximability
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
Bodo Manthey
78
Voted
WG
2007
Springer
15 years 3 months ago
Characterisations and Linear-Time Recognition of Probe Cographs
Cographs are those graphs without induced path on four vertices. A graph G is a probe cograph if its vertex set can be partitioned into two sets, N (non-probes) and P (probes) wher...
Van Bang Le, H. N. de Ridder
WG
2007
Springer
15 years 3 months ago
Mixing 3-Colourings in Bipartite Graphs
For a 3-colourable graph G, the 3-colour graph of G, denoted C3(G), is the graph with node set the proper vertex 3-colourings of G, and two nodes adjacent whenever the correspondi...
Luis Cereceda, Jan van den Heuvel, Matthew Johnson
WG
2007
Springer
15 years 3 months ago
Proper Helly Circular-Arc Graphs
A circular-arc model M = (C, A) is a circle C together with a collection A of arcs of C. If no arc is contained in any other then M is a proper circular-arc model, if every arc has...
Min Chih Lin, Francisco J. Soulignac, Jayme Luiz S...