316 search results - page 7 / 64 » On almost self-complementary graphs |
UAI
2008
13 years 10 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 10 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...
GC
2002
Springer
13 years 8 months ago
2002
Springer
An orientation of a digraph D is a spanning subdigraph of D obtained from D by deleting exactly one arc between x and y for every pair x = y of vertices such that both xy and yx a...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents ar...
SIAMDM
2008
13 years 8 months ago
2008
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...