Sciweavers

1883 search results - page 310 / 377
» Ordered theta graphs
Sort
View
ESA
2007
Springer
118views Algorithms» more  ESA 2007»
14 years 4 months ago
A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
Markus Chimani, Maria Kandyba, Petra Mutzel
EUROPAR
2007
Springer
14 years 4 months ago
On the Connectivity of Bluetooth-Based Ad Hoc Networks
We study the connectivity properties of a family of random graphs which closely model the Bluetooth’s device discovery process, where each device tries to connect to other device...
Pilu Crescenzi, Carlo Nocentini, Andrea Pietracapr...
FSTTCS
2007
Springer
14 years 4 months ago
Better Algorithms and Bounds for Directed Maximum Leaf Problems
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...
OTM
2007
Springer
14 years 4 months ago
Decentralised Commitment for Optimistic Semantic Replication
Abstract. We study large-scale distributed cooperative systems that use optimistic replication. We represent a system as a graph of actions (operations) connected by edges that rei...
Pierre Sutra, João Barreto, Marc Shapiro
PPDP
2007
Springer
14 years 4 months ago
Computing with subspaces
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
Sergio Antoy, Bernd Braßel