Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,401
Poly-logarithmic deterministic fully-dynamic graph algorithms I: connectivity and minimum spanning tree
- JOURNAL OF THE ACM
, 1997
"... Deterministic fully dynamic graph algorithms are presented for connectivity and minimum spanning forest. For connectivity, starting with no edges, the amortized cost for maintaining a spanning forest is O(log² n) per update, i.e. per edge insertion or deletion. Deciding connectivity between any two ..."
Abstract
-
Cited by 154 (7 self)
- Add to MetaCart
Deterministic fully dynamic graph algorithms are presented for connectivity and minimum spanning forest. For connectivity, starting with no edges, the amortized cost for maintaining a spanning forest is O(log² n) per update, i.e. per edge insertion or deletion. Deciding connectivity between any two
Fully-dynamic min-cut
- STOC'01
, 2001
"... We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~ O ( p n) time per edge insertion or deletion. Within logarithmic factors, this matches the best time bound for 1-edge connectivity. Previously, no o(n) bound was known for edge connectivity above 3, a ..."
Abstract
-
Cited by 18 (1 self)
- Add to MetaCart
We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~ O ( p n) time per edge insertion or deletion. Within logarithmic factors, this matches the best time bound for 1-edge connectivity. Previously, no o(n) bound was known for edge connectivity above 3
An Experimental Study of Poly-Logarithmic Fully-Dynamic Connectivity Algorithms
"... We present an experimental study of different variants of the amortized O(log2 n)-time fullydynamic connectivity algorithm of Holm, de Lichtenberg, and Thorup (STOC'98). The experiments build upon experiments provided by Alberts, Cattaneo, and Italiano (SODA'96) on the randomized amortized ..."
Abstract
- Add to MetaCart
amortized O(log3 n) fully-dynamic connectivity algorithm of Henzinger and King (STOC'95). Our experiments shed light upon commonalities and differences between the two algorithms.
Coverage Problems in Wireless Ad-hoc Sensor Networks
- in IEEE INFOCOM
, 2001
"... Wireless ad-hoc sensor networks have recently emerged as a premier research topic. They have great longterm economic potential, ability to transform our lives, and pose many new system-building challenges. Sensor networks also pose a number of new conceptual and optimization problems. Some, such as ..."
Abstract
-
Cited by 441 (9 self)
- Add to MetaCart
by a particular sensor network. We first define the coverage problem from several points of view including deterministic, statistical, worst and best case, and present examples in each domain. By combining computational geometry and graph theoretic techniques, specifically the Voronoi diagram and graph
Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs
- Third Annual European Symposium on Algorithms (ESA`95
, 1997
"... In this paper, we present sparse certificates for biconnectivity together with algorithms for updating these certificates. We thus obtain fully-dynamic algorithms for biconnectivity in graphs that run in O( # n log n log# m n #) amortized time per operation, where m is the number of edges and n i ..."
Abstract
-
Cited by 9 (1 self)
- Add to MetaCart
In this paper, we present sparse certificates for biconnectivity together with algorithms for updating these certificates. We thus obtain fully-dynamic algorithms for biconnectivity in graphs that run in O( # n log n log# m n #) amortized time per operation, where m is the number of edges and n
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata
- PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING
, 1989
"... In this paper we prove the intractability of learning several classes of Boolean functions in the distribution-free model (also called the Probably Approximately Correct or PAC model) of learning from examples. These results are representation independent, in that they hold regardless of the syntact ..."
Abstract
-
Cited by 347 (14 self)
- Add to MetaCart
of the syntactic form in which the learner chooses to represent its hypotheses. Our methods reduce the problems of cracking a number of well-known public-key cryptosystems to the learning problems. We prove that a polynomial-time learning algorithm for Boolean formulae, deterministic finite automata or constant
Polynomial time algorithms for multicast network code construction
- IEEE TRANS. ON INFO. THY
, 2005
"... The famous max-flow min-cut theorem states that a source node can send information through a network ( ) to a sink node at a rate determined by the min-cut separating and. Recently, it has been shown that this rate can also be achieved for multicasting to several sinks provided that the intermediat ..."
Abstract
-
Cited by 316 (29 self)
- Add to MetaCart
that the intermediate nodes are allowed to re-encode the information they receive. We demonstrate examples of networks where the achievable rates obtained by coding at intermediate nodes are arbitrarily larger than if coding is not allowed. We give deterministic polynomial time algorithms and even faster randomized
Fully-dynamic recognition algorithm and certificate for directed cographs
- Proc. 30th Int’l Workshop on Graph-Theoretic Concepts in Computer Science (WG’04), LNCS3353
, 2004
"... Abstract. This paper presents an optimal fully-dynamic recognition algorithm for directed cographs. Given the modular decomposition tree of a directed cograph G, the algorithm supports arc and vertex modification (insertion or deletion) in O(d) timewhered is the number of arcs involved in the operat ..."
Abstract
-
Cited by 5 (4 self)
- Add to MetaCart
Abstract. This paper presents an optimal fully-dynamic recognition algorithm for directed cographs. Given the modular decomposition tree of a directed cograph G, the algorithm supports arc and vertex modification (insertion or deletion) in O(d) timewhered is the number of arcs involved
Results 1 - 10
of
1,401
