Finding cycles and trees in sublinear time (Q2925521): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1648776928 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1007.4230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the girth of hamiltonian weakly pancyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding cycles and trees in sublinear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3152421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expanding graphs contain all small trees / 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: A sublinear bipartiteness tester for bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing in bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the randomness complexity of property testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three theorems regarding testing graph properties / 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: The disjoint paths problem in quadratic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing the diameter of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: lgorithmic and Analysis Techniques in Property Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank

Latest revision as of 03:55, 9 July 2024

scientific article
Language Label Description Also known as
English
Finding cycles and trees in sublinear time
scientific article

    Statements

    Finding cycles and trees in sublinear time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 October 2014
    0 references
    sublinear-time algorithms
    0 references
    property testing
    0 references
    bounded-degree graphs
    0 references
    one-sided versus two-sided error probability
    0 references

    Identifiers

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