8 search results - page 1 / 2 » Collapsible Pushdown Graphs of Level 2 are Tree-Automatic |
STACS
2010
Springer
15 years 7 months ago
2010
Springer
84
Voted
MFCS
2009
Springer
15 years 7 months ago
2009
Springer
Nested Pushdown Trees are unfoldings of pushdown graphs with an additional jump-relation. These graphs are closely related to collapsible pushdown graphs. They enjoy decidable µ-c...
140
click to vote
STOC
2010
ACM
15 years 4 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
85
Voted
VRML
1998
ACM
15 years 4 months ago
1998
ACM
We present a new method for (1) automatically generating multiple Levels Of Detail (LODs) of a polygonal surface, (2) progressively loading, or transmitting, and displaying a surf...
132
click to vote
FSTTCS
2010
Springer
14 years 10 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...