Sciweavers

3396 search results - page 193 / 680
» Tree representations of graphs
Sort
View
CGF
2010
118views more  CGF 2010»
13 years 9 months ago
The Readability of Path-Preserving Clusterings of Graphs
Graph visualization systems often exploit opaque metanodes to reduce visual clutter and improve the readability of large graphs. This filtering can be done in a path-preserving wa...
Daniel Archambault, Helen C. Purchase, Bruno Pinau...
SODA
2008
ACM
143views Algorithms» more  SODA 2008»
13 years 10 months ago
Dynamic optimality for skip lists and B-trees
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
Prosenjit Bose, Karim Douïeb, Stefan Langerma...
ACL
1997
13 years 10 months ago
Representing Constraints with Automata
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order ...
Frank Morawietz, Tom Cornell
AAAI
1996
13 years 10 months ago
A Graph-Based Method for Improving GSAT
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
Kalev Kask, Rina Dechter
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
14 years 26 days ago
Characterizing the dynamics of symmetry breaking in genetic programming
This paper introduces a metric that measures symmetry in tree graphs, which allows for a statistical characterization of GP solutions by their architectural "shapes." A ...
Jason M. Daida