Sciweavers

2503 search results - page 235 / 501
» A study of 3-arc graphs
Sort
View
AAAI
2008
15 years 9 months ago
Dormant Independence
The construction of causal graphs from non-experimental data rests on a set of constraints that the graph structure imposes on all probability distributions compatible with the gr...
Ilya Shpitser, Judea Pearl
USS
2008
15 years 9 months ago
Securing Provenance
Provenance describes how an object came to be in its present state. Intelligence dossiers, medical records and corporate financial reports capture provenance information. Many of ...
Uri Braun, Avraham Shinnar, Margo I. Seltzer
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
15 years 6 months ago
Fixed-Parameter Complexity of Minimum Profile Problems
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
Gregory Gutin, Stefan Szeider, Anders Yeo
DM
2006
87views more  DM 2006»
15 years 6 months ago
A vertex incremental approach for maintaining chordality
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...
Anne Berry, Pinar Heggernes, Yngve Villanger
JPDC
2008
129views more  JPDC 2008»
15 years 6 months ago
A framework for scalable greedy coloring on distributed-memory parallel computers
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
Doruk Bozdag, Assefaw Hadish Gebremedhin, Fredrik ...