Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms (Q3419712): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1002/jgt.20180 / rank
Normal rank
 
Property / author
 
Property / author: Khaled M. Elbassioni / rank
Normal rank
 
Property / author
 
Property / author: Vladimir A. Gurvich / rank
Normal rank
 
Property / author
 
Property / author: Khaled M. Elbassioni / rank
 
Normal rank
Property / author
 
Property / author: Vladimir A. Gurvich / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/jgt.20180 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4243953177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: LATIN 2004: Theoretical Informatics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4370201 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474103 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/JGT.20180 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:08, 21 December 2024

scientific article
Language Label Description Also known as
English
Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
scientific article

    Statements

    Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms (English)
    0 references
    0 references
    0 references
    0 references
    7 February 2007
    0 references
    blockers
    0 references
    generation algorithms
    0 references
    matchable graphs
    0 references

    Identifiers

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