Sciweavers

753 search results - page 1 / 151
» Completing a (k - 1)-Assignment
Sort
View
COLOGNETWENTE
2010
14 years 7 months ago
A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem
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...
Stefano Gualandi, Francesco Maffioli, Claudio Magn...
69
Voted
MFCS
2009
Springer
15 years 4 months ago
The Isomorphism Problem for k-Trees Is Complete for Logspace
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...
Johannes Köbler, Sebastian Kuhnert
EUROSYS
2006
ACM
15 years 4 months ago
K42: building a complete operating system
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...
Orran Krieger, Marc A. Auslander, Bryan S. Rosenbu...
ICFP
2008
ACM
15 years 10 months ago
Deciding kCFA is complete for EXPTIME
David Van Horn, Harry G. Mairson
59
Voted
ENDM
2006
74views more  ENDM 2006»
14 years 10 months ago
Antibandwidth of Complete k-Ary Trees
Tiziana Calamoneri, Annalisa Massini, Lubomir Toro...