Complexity results on untangling red-blue matchings (Q6101837): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/978-3-031-20624-5_44 / rank
 
Normal rank
Property / published in
 
Property / published in: LATIN 2022: Theoretical Informatics / rank
 
Normal rank
Property / publication date
 
26 July 2023
Timestamp+2023-07-26T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 26 July 2023 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Qxx / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Rxx / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Wxx / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7719377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flips in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flip distance to some plane configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Flips Required to Obtain Non-crossing Convex Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming Graphs with the Same Degree Sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Swap-Distances of Different Realizations of a Graphical Degree Sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Switching Distance Between Graphs with the Same Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Shortest Connected Graph Transformation for Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to reconfiguration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flipping edges in triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flip distance between two triangulations of a point set is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flip distance between triangulations of a planar point set is APX-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flip distance between triangulations of a simple polygon is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Perfect Matching Reconfiguration Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of reconfiguration problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of change / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a semi-dynamic convex hull algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3360902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matching problem in the plane / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:28, 2 August 2024

scientific article; zbMATH DE number 7699082
Language Label Description Also known as
English
Complexity results on untangling red-blue matchings
scientific article; zbMATH DE number 7699082

    Statements

    Complexity results on untangling red-blue matchings (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 June 2023
    0 references
    26 July 2023
    0 references
    reconfiguration
    0 references
    matching
    0 references
    planar geometry
    0 references
    NP-hard
    0 references
    0 references
    0 references

    Identifiers

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