3204 search results - page 236 / 641 » The b-chromatic Number of a Graph |
98
Voted
CP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We propose a novel way to solve these problems, mainly those that can be tr...
102
Voted
PPSWR
2005
Springer
15 years 6 months ago
2005
Springer
Metadata processing is recognized as a central challenge for database research in the next decade. Already, novel desktop data management and search applications (cf. Apple’s Spo...
110
click to vote
WEA
2010
Springer
15 years 5 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...
118
click to vote
TAMC
2010
Springer
15 years 5 months ago
2010
Springer
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that...
93
Voted
APWEB
2010
Springer
15 years 5 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...