1952 search results - page 97 / 391 » Complete partitions of graphs |
167
click to vote
PE
2011
Springer
14 years 11 months ago
2011
Springer
High-level semi-Markov modelling paradigms such as semi-Markov stochastic Petri nets and process algebras are used to capture realistic performance models of computer and communic...
160
click to vote
GC
2008
Springer
15 years 4 months ago
2008
Springer
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...
129
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
163
click to vote
CPC
2011
14 years 11 months ago
2011
Consider a randomly oriented graph G = (V, E) and let a, s and b be three distinct vertices in V . We study the correlation between the events {a → s} and {s → b}. We show that...
157
click to vote
CPC
2010
15 years 1 months ago
2010
A string graph is the intersection graph of a collection of continuous arcs in the plane. It is shown that any string graph with m edges can be separated into two parts of roughly...