1756 search results - page 150 / 352 » Directed scale-free graphs |
UAI
2008
13 years 9 months ago
2008
We conjecture that the worst case number of experiments necessary and sufficient to discover a causal graph uniquely given its observational Markov equivalence class can be specif...
SIROCCO
2007
13 years 9 months ago
2007
This paper studies the problem of broadcasting in synchronous point-to-point networks, where one initiator owns a piece of information that has to be transmitted to all other verti...
IJCAI
2001
13 years 9 months ago
2001
The progressive processing model allows a system to trade off resource consumption against the quality of the outcome by mapping each activity to a graph of potential solution met...
APVIS
2009
13 years 9 months ago
2009
The spring-electrical model based force directed algorithm is widely used for drawing undirected graphs, and sophisticated implementations can be very efficient for visualizing la...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...