The Complexity of the Gapped Consecutive-Ones Property Problem for Matrices of Bounded Maximum Degree

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-16181-0_23
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

A Maximum Property for the Characteristic Initial Value Problem of the Wave Equation

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1974English

Fine-Grained Complexity of Graph Homomorphism Problem for Bounded-Treewidth Graphs

2020English

Intransitive Permutation Groups With Bounded Movement Having Maximum Degree

JOURNAL OF ADVANCES IN MATHEMATICS
2019English

Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty

2019English

Bounding the Maximum Likelihood Degree

Mathematical Research Letters
Mathematics
2015English

A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials

2019English

The Maximum Multiflow Problems With Bounded Fractionality

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
2014English

The Complexity of the List Partition Problem for Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy