9842 search results - page 1446 / 1969 » The Complexity of the Matching-Cut Problem |
162
click to vote
ER
2009
Springer
16 years 1 months ago
2009
Springer
In previous work, we proposed an algebra whose operators allow to specify the valid compound terms of a faceted taxonomy, in a flexible manner (by combining positive and negative ...
188
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
197
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
211
click to vote
ICCS
2009
Springer
16 years 1 months ago
2009
Springer
The ultimate goal of data visualization is to clearly portray features relevant to the problem being studied. This goal can be realized only if users can effectively communicate t...
154
click to vote
INDOCRYPT
2009
Springer
16 years 1 months ago
2009
Springer
This paper investigates a new family of RFID protocols called Ff that grew out of a proposal made at ESORICS 2007. This family has the property of having highly efficient implement...