2283 search results - page 298 / 457 » Bounds of Graph Characteristics |
161
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
172
Voted
PODS
1999
ACM
15 years 7 months ago
1999
ACM
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
224
Voted
SIGAL
1990
15 years 7 months ago
1990
We propose and analyse a quasirandom analogue to the classical push model for disseminating information in networks ("randomized rumor spreading"). In the classical mode...
147
Voted
AI
2002
Springer
15 years 3 months ago
2002
Springer
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
140
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...