438 search results - page 3 / 88 » On Perfect Switching Classes |
NETWORKING
2004
13 years 8 months ago
2004
Several access protocols are proposed to support different service classes in an optical burst switched ring. Their performance is evaluated through simulation. Various performance...
DAM
2008
13 years 7 months ago
2008
Circular-perfect graphs form a natural superclass of perfect graphs: on the one hand due to their definition by means of a more general coloring concept, on the other hand as an i...
EUSFLAT
2007
13 years 9 months ago
2007
In this paper we summarize results on perfect MV-algebras and we show that the class of first order Lukasiewicz formulas valid in all interpretations over perfect MV-chains is ax...
CCR
2004
13 years 7 months ago
2004
Scheduling algorithms for input-queued packet switches have been widely researched. It has been shown that various classes of scheduling algorithms provide guarantees on stability ...
ENDM
2006
13 years 7 months ago
2006
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...