2310 search results - page 343 / 462 » Coloring Random Graphs |
ICPR
2010
IEEE
13 years 10 months ago
2010
IEEE
Social tagging is an increasingly popular way to describe and classify documents on the web. However, the quality of the tags varies considerably since the tags are authored freel...
ICCSA
2010
Springer
13 years 10 months ago
2010
Springer
This paper achieves O(n3 log log n/ log n) time for the 2center problems on a directed graph with non-negative edge costs under the conventional RAM model where only arithmetic ope...
ASUNAM
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
MASCOTS
2003
13 years 9 months ago
2003
Scalability is the primary challenge to studying large complex network systems with network emulation. This paper studies topology partitioning, assigning disjoint pieces of the n...
ACTAC
2007
13 years 8 months ago
2007
An o-line scheduling algorithm considers resource, precedence, and synchronisation requirements of a task graph, and generates a schedule guaranteeing its timing requirements. Th...