Sciweavers

3396 search results - page 26 / 680
» Tree representations of graphs
Sort
View
78
Voted
WIA
2005
Springer
15 years 6 months ago
Tree Automata and XPath on Compressed Trees
The complexity of various membership problems for tree automata on compressed trees is analyzed. Two compressed representations are considered: dags, which allow to share identical...
Markus Lohrey, Sebastian Maneth
IPPS
2002
IEEE
15 years 5 months ago
Optimizing Graph Algorithms for Improved Cache Performance
Tiling has long been used to improve cache performance. Recursion has recently been used as a cache-oblivious method of improving cache performance. Both of these techniques are n...
Joon-Sang Park, Michael Penner, Viktor K. Prasanna
AIPS
2000
15 years 1 months ago
New Advances in GraphHTN: Identifying Independent Subproblems in Large HTN Domains
We describe in this paper a new method for extracting knowledge on Hierarchical Task-Network (HTN) planning problems for speeding up the search. This knowledge is gathered by prop...
Amnon Lotem, Dana S. Nau
CORR
2008
Springer
137views Education» more  CORR 2008»
15 years 18 days ago
On the Complexity of Nash Equilibria of Action-Graph Games
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
Constantinos Daskalakis, Grant Schoenebeck, Gregor...
DM
2007
106views more  DM 2007»
15 years 14 days ago
The Roberts characterization of proper and unit interval graphs
In this note, a constructive proof is given that the classes of proper interval graphs and unit interval graphs coincide, a result originally established by Fred S. Roberts. Addit...
Frédéric Gardi