Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs (Q1751242)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
scientific article

    Statements

    Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs (English)
    0 references
    0 references
    24 May 2018
    0 references
    combinatorial algorithm
    0 references
    matching theory
    0 references
    traveling salesman problem
    0 references
    restricted 2-matching
    0 references
    subtour elimination constraint
    0 references
    Hamilton-laceable graph
    0 references
    0 references
    0 references
    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