2612 search results - page 127 / 523 » Switching Graphs and Their Complexity |
119
click to vote
CORR
2007
Springer
14 years 10 months ago
2007
Springer
—We consider point to point link scheduling in Spatial Time Division Multiple Access (STDMA) wireless networks under the physical interference model. We propose a novel link sche...
DAM
2007
14 years 10 months ago
2007
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
We propose a model for the World Wide Web graph that couples the topological growth with the traffic's dynamical evolution. The model is based on a simple traffic-driven dynam...
114
click to vote
CSL
2007
Springer
15 years 4 months ago
2007
Springer
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
WAOA
2005
Springer
15 years 3 months ago
2005
Springer
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...