Sciweavers

3778 search results - page 117 / 756
» Representing Web Graphs
Sort
View
NIPS
2008
14 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
ACTA
2006
74views more  ACTA 2006»
14 years 10 months ago
Linearly bounded infinite graphs
Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural family of canonical infinite automata representing their...
Arnaud Carayol, Antoine Meyer
MICS
2008
72views more  MICS 2008»
14 years 9 months ago
Dynamic Multi-level Overlay Graphs for Shortest Paths
Multi-level overlay graphs represent a speed-up technique for shortest paths computation which is based on a hierarchical decomposition of a weighted directed graph G. They have b...
Francesco Bruera, Serafino Cicerone, Gianlorenzo D...
CORR
2004
Springer
111views Education» more  CORR 2004»
14 years 9 months ago
Layout of Graphs with Bounded Tree-Width
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum numb...
Vida Dujmovic, Pat Morin, David R. Wood
EDM
2008
113views Data Mining» more  EDM 2008»
14 years 11 months ago
Mining and Visualizing Visited Trails in Web-Based Educational Systems
A data mining and visualization tool for the discovery of student trails in web-based educational systems is presented and described. The tool uses graphs to visualize results, all...
Cristóbal Romero, Sergio Gutiérrez S...