753 search results - page 1 / 151 » Completing a (k - 1)-Assignment |
COLOGNETWENTE
2010
13 years 1 months ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We show that k-tree isomorphism can be decided in logarithmic space by giving a logspace canonical labeling algorithm. This improves over the previous StUL upper bound an...
EUROSYS
2006
ACM
13 years 10 months ago
2006
ACM
K42 is one of the few recent research projects that is examining operating system design structure issues in the context of new whole-system design. K42 is open source and was des...
ICFP
2008
ACM
14 years 4 months ago
2008
ACM
ENDM
2006
13 years 4 months ago
2006
