On a generalization of Nemhauser and Trotter's local optimization theorem (Q340561): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
aliases / en / 0aliases / en / 0
 
On a Generalization of Nemhauser and Trotter’s Local Optimization Theorem
description / endescription / en
scientific article
scientific article; zbMATH DE number 6528554
Property / title
 
On a Generalization of Nemhauser and Trotter’s Local Optimization Theorem (English)
Property / title: On a Generalization of Nemhauser and Trotter’s Local Optimization Theorem (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1472.68124 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-662-48971-0_38 / rank
 
Normal rank
Property / published in
 
Property / published in: Algorithms and Computation / rank
 
Normal rank
Property / publication date
 
11 January 2016
Timestamp+2016-01-11T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 11 January 2016 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6528554 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2231757830 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3087960374 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1601.00164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crown structures for vertex cover kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Algorithms for Bipartite Network Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extension of the Nemhauser–Trotter Theorem to Generalized Vertex Cover with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3337223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bounded-degree vertex deletion parameterized by treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Cover: Further Observations and Further Improvements / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Kernel for Co-Path/Cycle Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crown reductions for the minimum weighted vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Nemhauser and Trotter's local optimization theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalization of Nemhauser and Trotter's Local Optimization Theorem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isolation concepts for efficiently enumerating dense subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Parameterized Algorithms Using Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Looking at the stars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph‐theoretic generalization of the clique concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 4 <i>k</i> <sup>2</sup> kernel for feedback vertex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Vertex Cover in Graphs with Maximum Degree 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parameterized Algorithm for Bounded-Degree Vertex Deletion / rank
 
Normal rank

Latest revision as of 22:22, 12 July 2024

scientific article; zbMATH DE number 6528554
  • On a Generalization of Nemhauser and Trotter’s Local Optimization Theorem
Language Label Description Also known as
English
On a generalization of Nemhauser and Trotter's local optimization theorem
scientific article; zbMATH DE number 6528554
  • On a Generalization of Nemhauser and Trotter’s Local Optimization Theorem

Statements

On a generalization of Nemhauser and Trotter's local optimization theorem (English)
0 references
On a Generalization of Nemhauser and Trotter’s Local Optimization Theorem (English)
0 references
0 references
14 November 2016
0 references
11 January 2016
0 references
kernelization
0 references
fixed-parameter tractable
0 references
graph algorithms
0 references
graph theory
0 references
graph decomposition
0 references
bounded-degree vertex deletion
0 references
0 references
0 references
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references