Sciweavers

5473 search results - page 136 / 1095
» On the graph isomorphism problem
Sort
View
ICALP
2007
Springer
16 years 1 months ago
Parameterized Algorithms for Directed Maximum Leaf Problems
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...
151
Voted
DM
2010
131views more  DM 2010»
15 years 7 months ago
Planar graphs without adjacent cycles of length at most seven are 3-colorable
We prove that every planar graph in which no i-cycle is adjacent to a j-cycle whenever 3 i j 7 is 3-colorable and pose some related problems on the 3-colorability of planar grap...
Oleg V. Borodin, Mickaël Montassier, Andr&eac...
GC
2010
Springer
15 years 5 months ago
Star-Uniform Graphs
A star-factor of a graph is a spanning subgraph each of whose components is a star. A graph
Mikio Kano, Yunjian Wu, Qinglin Yu
AAAI
2012
13 years 9 months ago
Transfer Learning with Graph Co-Regularization
Transfer learning proves to be effective for leveraging labeled data in the source domain to build an accurate classifier in the target domain. The basic assumption behind transf...
Mingsheng Long, Jianmin Wang 0001, Guiguang Ding, ...
212
Voted
MST
2011
207views Hardware» more  MST 2011»
15 years 1 months ago
Fixpoint Logics over Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Stefan Göller, Markus Lohrey