253 search results - page 7 / 51 » Perfection thickness of graphs |
IPMI
2011
Springer
12 years 12 months ago
2011
Springer
Abstract. Brain matching is an important problem in neuroimaging studies. Current surface-based methods for cortex matching and atlasing, although quite accurate, can require long ...
ENDM
2010
13 years 8 months ago
2010
A main result of combinatorial optimization is that clique and chromatic number of a perfect graph are computable in polynomial time (Gr
EJC
2010
13 years 8 months ago
2010
A conjecture of G. Fan and A. Raspaud asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. We suggest a possible approach to problem...
ICDM
2006
IEEE
14 years 2 months ago
2006
IEEE
Mining graph databases for frequent subgraphs has recently developed into an area of intensive research. Its main goals are to reduce the execution time of the existing basic algo...
JCT
2006
13 years 8 months ago
2006
We consider the class A of graphs that contain no odd hole, no antihole, and no "prism" (a graph consisting of two disjoint triangles with three disjoint paths between th...