863 search results - page 53 / 173 » Links in edge-colored graphs |
ICDM
2008
IEEE
14 years 3 months ago
2008
IEEE
OLAP (On-Line Analytical Processing) is an important notion in data analysis. Recently, more and more graph or networked data sources come into being. There exists a similar need ...
PODC
2003
ACM
14 years 1 months ago
2003
ACM
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...
ICGA
1997
13 years 10 months ago
1997
Parallel Distributed Genetic Programming (PDGP) is a new form of Genetic Programming (GP) suitable for the development of programs with a high degree of parallelism. Programs are ...
TC
1998
13 years 8 months ago
1998
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...
SPAA
2012
ACM
11 years 11 months ago
2012
ACM
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...