Largest planar matching in random bipartite graphs (Q4803315): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Q198589 / rank
Normal rank
 
Property / author
 
Property / author: Marcos A. Kiwi / 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/rsa.10048 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2170483796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest Increasing and Decreasing Subsequences / rank
 
Normal rank

Revision as of 13:42, 5 June 2024

scientific article; zbMATH DE number 1891626
Language Label Description Also known as
English
Largest planar matching in random bipartite graphs
scientific article; zbMATH DE number 1891626

    Statements

    Largest planar matching in random bipartite graphs (English)
    0 references
    0 references
    0 references
    2 April 2003
    0 references
    longest increasing subsequence
    0 references
    longest common subsequence
    0 references
    random bipartite graphs
    0 references

    Identifiers

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