42 search results - page 2 / 9 » Finding a 2-Core of a Tree in Linear Time |
COCOON
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We consider finding maximin strategies and equilibria of explicitly given extensive form games with imperfect information but with no moves of chance. We show that a max...
STOC
1994
ACM
13 years 9 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
WADS
1997
Springer
13 years 9 months ago
1997
Springer
In this paper we consider the problem of nding a core of limited length in a tree. A core is a path, which minimizes the sum of the distances to all nodes in the tree. This proble...
DEXAW
2006
IEEE
13 years 11 months ago
2006
IEEE
Detecting structural similarities between XML documents has been the subject of several recent work, and the proposed algorithms mostly use tree edit distance between the correspo...
MICS
2010
13 years 3 months ago
2010
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...