Editing to a graph of given degrees (Q2354405): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 6 users not shown)
aliases / en / 0aliases / en / 0
 
Editing to a Graph of Given Degrees
description / endescription / en
scientific article
scientific article; zbMATH DE number 6482358
Property / author
 
Property / author: Petr A. Golovach / rank
Normal rank
 
Property / title
 
Editing to a Graph of Given Degrees (English)
Property / title: Editing to a Graph of Given Degrees (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1380.68222 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-13524-3_17 / rank
 
Normal rank
Property / published in
 
Property / published in: Parameterized and Exact Computation / rank
 
Normal rank
Property / publication date
 
15 September 2015
Timestamp+2015-09-15T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 15 September 2015 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C07 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6482358 / rank
 
Normal rank
Property / author
 
Property / author: Petr A. Golovach / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1577575477 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2569041303 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1311.4768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trinomial analogue of Bailey's lemma and \(N=2\) superconformal invariance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness results for edge modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability of graph modification problems for hereditary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of even/odd subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Win-Win Kernelization for Degree Sequence Completion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of finding subgraphs with hereditary properties. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Editing graphs to satisfy degree constraints: a parameterized approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of finding regular induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity classification of some edge modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-and edge-deletion NP-complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive approximation for edge-deletion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Eulerian Deletion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Editing to a Connected Graph of Given Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Editing to a graph of given degrees / rank
 
Normal rank

Latest revision as of 18:11, 10 July 2024

scientific article; zbMATH DE number 6482358
  • Editing to a Graph of Given Degrees
Language Label Description Also known as
English
Editing to a graph of given degrees
scientific article; zbMATH DE number 6482358
  • Editing to a Graph of Given Degrees

Statements

Editing to a graph of given degrees (English)
0 references
Editing to a Graph of Given Degrees (English)
0 references
13 July 2015
0 references
15 September 2015
0 references
parameterized complexity
0 references
graph editing
0 references
graphs of given degrees
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