Results 1  10
of
810,505
UNIQUE PATH PARTITIONS
"... Abstract. We give a complete classification of the unique path partitions. In this note we classify the unique path partitions (for short uppartitions). They are described as follows. If µ = (a1, a2,..., ak) and λ are partitions of n, then a µpath in λ is a sequence of partitions, λ = λ0, λ1,..., ..."
Abstract
 Add to MetaCart
Abstract. We give a complete classification of the unique path partitions. In this note we classify the unique path partitions (for short uppartitions). They are described as follows. If µ = (a1, a2,..., ak) and λ are partitions of n, then a µpath in λ is a sequence of partitions, λ = λ0, λ1
STCON in Directed UniquePath Graphs
"... ABSTRACT. We study the problem of spaceefficient polynomialtime algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s,t, the STCON problem is to decide if thereexistsapathfrom s to t in G. For general graphs, thebestpolynomialtime algorithm forSTCONuse ..."
Abstract
 Add to MetaCart
. For these graphs, we give a polynomialtime algorithm that uses Õ(n ε) space for any constant ε ∈ (0,1]. We also give a polynomialtime, Õ(n ε)space algorithm to recognize uniquepath graphs. Uniquepath graphs are related to configuration graphs of unambiguous logspace computations, but they can have some
1 Unique paths as formal points
"... SCHUSTER Abstract:A pointfree formulation of the König Lemma for trees with uniformly at most one infinite path allows for a constructive proof without unique choice. ..."
Abstract
 Add to MetaCart
SCHUSTER Abstract:A pointfree formulation of the König Lemma for trees with uniformly at most one infinite path allows for a constructive proof without unique choice.
On the Maximum Density of Graphs with UniquePath Labellings
"... A uniquepath labelling of a simple, finite graph is a labelling of its edges with real numbers such that, for every ordered pair of vertices (u, v), there is at most one nondecreasing path from u to v. In this paper we prove that any graph on n vertices that admits a uniquepath labelling has at mo ..."
Abstract
 Add to MetaCart
A uniquepath labelling of a simple, finite graph is a labelling of its edges with real numbers such that, for every ordered pair of vertices (u, v), there is at most one nondecreasing path from u to v. In this paper we prove that any graph on n vertices that admits a uniquepath labelling has
A HighThroughput Path Metric for MultiHop Wireless Routing
, 2003
"... This paper presents the expected transmission count metric (ETX), which finds highthroughput paths on multihop wireless networks. ETX minimizes the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination. The E ..."
Abstract

Cited by 1078 (5 self)
 Add to MetaCart
This paper presents the expected transmission count metric (ETX), which finds highthroughput paths on multihop wireless networks. ETX minimizes the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination
Split Multipath Routing with Maximally Disjoint Paths in Ad Hoc Networks
 In Proc. Int. IEEE Conf. on Comm., 2001
"... Abstract – In recent years, routing has been the most focused area in ad hoc networks research. Ondemand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed ondemand routing protocols however ..."
Abstract

Cited by 421 (4 self)
 Add to MetaCart
however, build and rely on single route for each data session. Whenever there is a link disconnection on the active route, the routing protocol must perform a route recovery process. In QoS routing for wired networks, multiple path routing is popularly used. Multiple routes are however, constructed using
The SmallWorld Phenomenon: An Algorithmic Perspective
 in Proceedings of the 32nd ACM Symposium on Theory of Computing
, 2000
"... Long a matter of folklore, the “smallworld phenomenon ” — the principle that we are all linked by short chains of acquaintances — was inaugurated as an area of experimental study in the social sciences through the pioneering work of Stanley Milgram in the 1960’s. This work was among the first to m ..."
Abstract

Cited by 826 (5 self)
 Add to MetaCart
algorithm capable of finding short paths with high probability. More generally, we provide a strong characterization of this family of network models, showing that there is in fact a unique model within the family for which decentralized algorithms are effective.
Finding the k Shortest Paths
, 1997
"... We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest pat ..."
Abstract

Cited by 401 (2 self)
 Add to MetaCart
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest
Alternatingtime Temporal Logic
 Journal of the ACM
, 1997
"... Temporal logic comes in two varieties: lineartime temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branchingtime temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general var ..."
Abstract

Cited by 615 (55 self)
 Add to MetaCart
Temporal logic comes in two varieties: lineartime temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branchingtime temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general
Results 1  10
of
810,505