Sciweavers

42 search results - page 1 / 9
» Finding a Two-Core of a Tree in Linear Time
Sort
View
ISAAC
2000
Springer
95views Algorithms» more  ISAAC 2000»
13 years 10 months ago
Finding a Two-Core of a Tree in Linear Time
Biing-Feng Wang, Jyh-Jye Lin
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
13 years 7 months ago
Finding an optimal tree searching strategy in linear time
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
Shay Mozes, Krzysztof Onak, Oren Weimann
SIAMDM
2002
85views more  SIAMDM 2002»
13 years 6 months ago
Finding a 2-Core of a Tree in Linear Time
Let T be an edge-weighted tree. A p-core of T is a set of p mutually disjoint paths in T that minimizes the sum of the distances of all vertices in T from any of the p paths, where...
Biing-Feng Wang
SODA
2008
ACM
134views Algorithms» more  SODA 2008»
13 years 7 months ago
Fast algorithms for finding proper strategies in game trees
We show how to find a normal form proper equilibrium in behavior strategies of a given two-player zero-sum extensive form game with imperfect information but perfect recall. Our a...
Peter Bro Miltersen, Troels Bjerre Sørensen
PLDI
1994
ACM
13 years 10 months ago
The Program Structure Tree: Computing Control Regions in Linear Time
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flo...
Richard Johnson, David Pearson, Keshav Pingali