Reconfiguration of maximum-weight \(b\)-matchings in a graph (Q2420651): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-018-0289-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2803094153 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rerouting shortest paths in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguring Independent Sets in Claw-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithm for sliding tokens on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-dominating graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of dominating set reconfiguration / rank
 
Normal rank
Property / cites work
 
Property / cites work: The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of reconfiguration problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration of Cliques in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration of Vertex Covers in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration of maximum weight \(b\)-matchings in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of independent set reconfigurability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the Boolean connectivity problem for \(k\)-CNF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Cover Reconfiguration and Beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree-Constrained Subgraph Reconfiguration is in P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of change / rank
 
Normal rank

Latest revision as of 12:11, 19 July 2024

scientific article
Language Label Description Also known as
English
Reconfiguration of maximum-weight \(b\)-matchings in a graph
scientific article

    Statements

    Reconfiguration of maximum-weight \(b\)-matchings in a graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 June 2019
    0 references
    combinatorial reconfiguration
    0 references
    graph algorithm
    0 references
    \(b\)-matching
    0 references

    Identifiers