9842 search results - page 65 / 1969 » The Complexity of the Matching-Cut Problem |
KDD
1997
ACM
13 years 11 months ago
1997
ACM
Sequential Data This paper is about the unsuperviseddiscovery of patterns in sequencesof compositeobjects. A compositeobject may be describedas a sequenceof other, simpler data. In...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. A common way of dealing with the paradoxes of preference aggregation consists in restricting the domain of admissible preferences. The most well-known such restriction is...
ENDM
2010
13 years 7 months ago
2010
Deciding whether an arbitrary graph admits a VLSI layout with unit-length edges is NP-complete [1], even when restricted to binary trees [7]. However, for certain graphs, the prob...
DAM
2006
13 years 7 months ago
2006
In the paper, the computational complexity of several variants of the problem of isothermic DNA sequencing by hybridization, is analyzed. The isothermic sequencing is a recent met...
JACM
2000
13 years 7 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...