Planar graphs: Random walks and bipartiteness testing (Q5236926): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1407.2109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing <i>k</i>-colorability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every minor-closed property of sparse graphs is testable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing. Current research and surveys / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing and its connection to learning and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing in bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sublinear bipartiteness tester for bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Graph Partitions for Approximation and Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4606322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for Testing Bipartiteness in General Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluded minors, network decomposition, and multicommodity flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Forest-Isomorphism in the Adjacency List Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the distance to properties in bounded-degree and general sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Property of Hyperfinite Graphs Is Testable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing the diameter of graphs / rank
 
Normal rank

Latest revision as of 17:16, 20 July 2024

scientific article; zbMATH DE number 7118075
Language Label Description Also known as
English
Planar graphs: Random walks and bipartiteness testing
scientific article; zbMATH DE number 7118075

    Statements

    Planar graphs: Random walks and bipartiteness testing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 October 2019
    0 references
    0 references
    planar graphs
    0 references
    property testing
    0 references
    randomized algorithms
    0 references
    0 references
    0 references