Sciweavers

2125 search results - page 67 / 425
» On Graph Complexity
Sort
View
CSR
2008
Springer
13 years 7 months ago
Colouring, constraint satisfaction, and complexity
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
Pavol Hell, Jaroslav Nesetril
JSAC
2011
116views more  JSAC 2011»
13 years 2 months ago
Low Complexity Outage Optimal Distributed Channel Allocation for Vehicle-to-Vehicle Communications
—Due to the potential of enhancing traffic safety, protecting environment, and enabling new applications, vehicular communications, especially vehicle-to-vehicle (V2V) communica...
Bo Bai, Wei Chen, Khaled Ben Letaief, Zhigang Cao
COMPGEOM
2005
ACM
13 years 9 months ago
The Visibility-Voronoi Complex and Its Applications
We introduce a new type of diagram called the VV(c)-diagram (the visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diag...
Ron Wein, Jur P. van den Berg, Dan Halperin
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
13 years 11 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
ASWEC
2004
IEEE
13 years 11 months ago
Snapshot Query-Based Debugging
Object-oriented programs, when executed, produce a complex webs of objects and references between them, generally referred to as object graphs. These object graphs are difficult t...
Alex Potanin, James Noble, Robert Biddle