4171 search results - page 19 / 835 » Choice numbers of graphs |
WEA
2010
Springer
14 years 1 months ago
2010
Springer
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
APWEB
2010
Springer
14 years 1 months ago
2010
Springer
—Extensive research has been conducted on top of online social networks (OSNs), while little attention has been paid to the data collection process. Due to the large scale of OSN...
CONSTRAINTS
2007
13 years 8 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
BIOINFORMATICS
2007
13 years 8 months ago
2007
Motivation: The functioning of biological networks depends in large part on their complex underlying structure. When studying their systemic nature many modeling approaches focus ...
GLOBECOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— Routing policies used in the Internet can be restrictive, limiting communication between source-destination pairs to one path, when often better alternatives exist. To avoid ro...