347 search results - page 21 / 70 » Schaefer's theorem for graphs |
ARSCOM
2002
14 years 9 months ago
2002
In 1973, Deuber published his famous proof of Rado's conjecture regarding partition regular sets. In his proof, he invented structures called (m, p, c)-sets and gave a partit...
STOC
2004
ACM
15 years 9 months ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
114
click to vote
ACSAC
2005
IEEE
15 years 3 months ago
2005
IEEE
Understanding the security goals provided by cryptographic protocol implementations is known to be difficult, since security requirements such as secrecy, integrity and authentici...
GC
2007
Springer
14 years 9 months ago
2007
Springer
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
TPHOL
2008
IEEE
15 years 3 months ago
2008
IEEE
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...