553 search results - page 67 / 111 » Cover Contact Graphs |
68
Voted
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
SEMWEB
2005
Springer
15 years 3 months ago
2005
Springer
This paper extends the model theory of RDF with rules, placing an emphasis on integration with OWL and decidability of entailstart from an abstract syntax that views a rule as a pa...
AVI
2008
14 years 11 months ago
2008
Programming assignments are easy to plagiarize in such a way as to foil casual reading by graders. Graders can resort to automatic plagiarism detection systems, which can generate...
CORR
2004
Springer
14 years 10 months ago
2004
Springer
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of "asleep" robots, by having an awak...
COMBINATORICS
2000
14 years 10 months ago
2000
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...