1736 search results - page 200 / 348 » On antimagic directed graphs |
162
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
188
click to vote
ISAAC
2004
Springer
15 years 12 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
195
click to vote
KR
2004
Springer
15 years 12 months ago
2004
Springer
In this paper, partial knowledge about the possible transitions which can take place in a dynamical environment is represented by a set of pairs of propositional formulae, with th...
155
click to vote
UAI
2008
15 years 8 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...
152
click to vote
SIROCCO
2007
15 years 8 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...