2503 search results - page 161 / 501 » A study of 3-arc graphs |
195
click to vote
OL
2010
15 years 1 months ago
2010
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...
161
click to vote
COMBINATORICS
2004
15 years 6 months ago
2004
We consider the Goldberg-Coxeter construction GCk,l(G0) (a generalization of a simplicial subdivision of the dodecahedron considered in [Gold37] and [Cox71]), which produces a pla...
163
click to vote
AAAI
2008
15 years 9 months 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...
151
click to vote
NIPS
2008
15 years 8 months ago
2008
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
177
click to vote
COLOGNETWENTE
2009
15 years 7 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...