195 search results - page 35 / 39 » A polynomial algorithm for the p-centdian problem on a tree |
FCT
2009
Springer
13 years 11 months ago
2009
Springer
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
EGH
2009
Springer
13 years 5 months ago
2009
Springer
A major factor for the efficiency of ray tracing is the use of good acceleration structures. Recently, bounding volume hierarchies (BVHs) have become the preferred acceleration st...
DAM
2007
13 years 7 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
COLT
2004
Springer
14 years 1 months ago
2004
Springer
: We introduce a graph-theoretic generalization of classical Arrow-Debreu economics, in which an undirected graph specifies which consumers or economies are permitted to engage in...
PLANX
2008
13 years 9 months ago
2008
Regular Expressions (REs) form the basis of most XML type languages, such as DTDs, XML Schema types, and XDuce types (Thompson et al. 2004; Hosoya and Pierce 2003). In this contex...