9842 search results - page 291 / 1969 » The Complexity of the Matching-Cut Problem |
109
Voted
TARK
2005
Springer
15 years 9 months ago
2005
Springer
Fagin, Halpern, Moses, and Vardi have proposed a framework of epistemic agents with multiple “frames of mind” (local-reasoning structures), to solve problems concerning incons...
132
click to vote
ESA
2001
Springer
15 years 8 months ago
2001
Springer
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
105
click to vote
CSL
2007
Springer
15 years 9 months ago
2007
Springer
Recently it has been shown that the miniaturization mapping M faithfully translates subexponential parameterized complexity into (unbounded) parameterized complexity. We determine...
127
Voted
EUROCAST
2005
Springer
15 years 9 months ago
2005
Springer
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
122
Voted
ICCS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Hierarchical (H)-matrices approximate full or sparse matrices using a hierarchical data sparse format. The corresponding H-matrix arithmetic reduces the time complexity o...