1605 search results - page 91 / 321 » On Partitional Labelings of Graphs |
ICITA
2005
IEEE
14 years 3 months ago
2005
IEEE
A re-ranking technique,called “PageRank brings a successful story behind the search engine. Many studies focus on finding an way to compute the PageRank scores of a large web gr...
MICCAI
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. Graph-based algorithms have become increasingly popular for medical image segmentation. The fundamental process for each of these algorithms is to use the image content t...
HPCC
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
AAAI
2008
14 years 35 min ago
2008
Complex graphs, in which multi-type nodes are linked to each other, frequently arise in many important applications, such as Web mining, information retrieval, bioinformatics, and...
CSCLP
2005
Springer
14 years 3 months ago
2005
Springer
We discuss four variants of the graph colouring problem, and present algorithms for solving them. The problems are k-Colourability, Max Ind k-COL, Max Val k-COL, and, finally, Max...