Sciweavers

1545 search results - page 114 / 309
» On tree congestion of graphs
Sort
View
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
15 years 1 months 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
FSTTCS
2000
Springer
15 years 1 months ago
Model Checking CTL Properties of Pushdown Systems
: A pushdown system is a graph G(P) of configurations of a pushdown automaton P. The model checking problem for a logic L is: given a pushdown automaton P and a formula L decide ...
Igor Walukiewicz
ACL
2006
14 years 11 months ago
Creating a CCGbank and a Wide-Coverage CCG Lexicon for German
We present an algorithm which creates a German CCGbank by translating the syntax graphs in the German Tiger corpus into CCG derivation trees. The resulting corpus contains 46,628 ...
Julia Hockenmaier
IPL
2006
72views more  IPL 2006»
14 years 10 months ago
Structure and linear time recognition of 3-leaf powers
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is the k...
Andreas Brandstädt, Van Bang Le
IWOCA
2010
Springer
240views Algorithms» more  IWOCA 2010»
14 years 4 months ago
Path-Based Supports for Hypergraphs
A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-complete to compute a path-ba...
Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, A...