64 search results - page 9 / 13 » The Complexity of the List Homomorphism Problem for Graphs |
129
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
142
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
140
click to vote
PODC
2005
ACM
15 years 10 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
139
click to vote
SPAA
2009
ACM
15 years 11 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
138
click to vote
SIGMOD
2010
ACM
15 years 9 months ago
2010
ACM
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...