169 search results - page 8 / 34 » Counting paths in digraphs |
CPM
2008
Springer
13 years 10 months ago
2008
Springer
Let G be an unweighted and undirected graph of n nodes, and let D be the n
CC
2004
Springer
14 years 2 months ago
2004
Springer
We present an algorithm for counting the number of integer solutions to selected free variables of a Presburger formula. We represent the Presburger formula as a deterministic fin...
ADHOC
2007
13 years 8 months ago
2007
In the past five years Bluetooth scatternets were one of the most promising wireless networking technologies for ad hoc networking. In such networks, mobility together with the f...
ICDT
2007
ACM
14 years 13 days ago
2007
ACM
Abstract. We review key constraints in the context of XML as introduced by Buneman et al. We show that one of the proposed inference rules is not sound in general, and the axiomati...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We consider the minimum equivalent digraph (directed network) problem (also known as the strong transitive reduction) and its maximum objective function variant, with two types of...