Sciweavers

9532 search results - page 314 / 1907
» Logic, Graphs, and Algorithms
Sort
View
CORR
2010
Springer
88views Education» more  CORR 2010»
15 years 6 months ago
A characterization of b-perfect graphs
A b-coloring is a coloring of the vertices of a graph such that each color class contains a vertex that has a neighbor in all other color classes, and the b-chromatic number of a ...
Chính T. Hoàng, Frédér...
IJFCS
2007
93views more  IJFCS 2007»
15 years 6 months ago
On Computing Longest Paths in Small Graph Classes
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
Ryuhei Uehara, Yushi Uno
KAIS
2007
121views more  KAIS 2007»
15 years 6 months ago
Node similarity in the citation graph
Published scientific articles are linked together into a graph, the citation graph, through their citations. This paper explores the notion of similarity based on connectivity alo...
Wangzhong Lu, Jeannette C. M. Janssen, Evangelos E...
SDM
2012
SIAM
304views Data Mining» more  SDM 2012»
13 years 9 months ago
Fast Random Walk Graph Kernel
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...
U. Kang, Hanghang Tong, Jimeng Sun
IPPS
1997
IEEE
15 years 11 months ago
A Comparison of Parallel Approaches for Algebraic Factorization in Logic Synthesis
Algebraic factorization is an extremely important part of any logic synthesis system but is computationally expensive. Hence it is important to look at parallel processing to spee...
Sumit Roy, Prithviraj Banerjee