Sciweavers

5889 search results - page 72 / 1178
» Graph Layout Problems
Sort
View
NIPS
2008
13 years 11 months ago
Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
Lukas Kroc, Ashish Sabharwal, Bart Selman
IPL
2007
81views more  IPL 2007»
13 years 10 months ago
Linear-time algorithms for problems on planar graphs with fixed disk dimension
The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties ...
Faisal N. Abu-Khzam, Michael A. Langston
INFOVIS
1999
IEEE
14 years 2 months ago
Constellation: A Visualization Tool for Linguistic Queries from MindNet
ct Constellation is a visualization system for the results of queries from the MindNet natural language semantic network. Constellation is targeted at helping MindNet's creato...
Tamara Munzner, François Guimbretièr...
CGF
2008
110views more  CGF 2008»
13 years 10 months ago
TimeRadarTrees: Visualizing Dynamic Compound Digraphs
The evolution of dependencies in information hierarchies can be modeled by sequences of compound digraphs with edge weights. In this paper we present a novel approach to visualize...
Michael Burch, Stephan Diehl
MST
2006
99views more  MST 2006»
13 years 10 months ago
Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
Tobias Riege, Jörg Rothe