2310 search results - page 300 / 462 » Coloring Random Graphs |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
PVLDB
2010
13 years 6 months ago
2010
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...
BMVC
2010
13 years 6 months ago
2010
Markov random field pixel labelling is often used to obtain image segmentations in which each segment or region is labelled according to its attributes such as colour or texture. ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...