𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The complexity of matching with bonds

✍ Scribed by Manfred Padberg; Antonio Sassano

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
549 KB
Volume
32
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Comparison Complexity of the Stri
On the Comparison Complexity of the String Prefix-Matching Problem
✍ Dany Breslauer; Livio Colussi; Laura Toniolo πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 525 KB

In this paper we study the exact comparison complexity of the string prefixmatching problem in the deterministic sequential comparison model with equality tests. We derive almost tight lower and upper bounds on the number of symbol comparisons required in the worst case by on-line prefix-matching al

On the Complexity of Pattern Matching fo
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts
✍ Piotr Berman; Marek Karpinski; Lawrence L. Larmore; Wojciech Plandowski; Wojciec πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 293 KB

We consider the complexity of problems related to two-dimensional texts (2D-texts) described succinctly. In a succinct description, larger rectangular subtexts are defined in terms of smaller parts in a way similar to that

The complexity of the matching-cut probl
The complexity of the matching-cut problem for planar graphs and other graph classes
✍ Paul Bonsma πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 247 KB

## Abstract The Matching‐Cut problem is the problem to decide whether a graph has an edge cut that is also a matching. Previously this problem was studied under the name of the Decomposable Graph Recognition problem, and proved to be ${\cal{NP}}$‐complete when restricted to graphs with maximum deg