Testing convexity properties of tree colorings (Q547293): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5916744 / rank
 
Normal rank
Property / zbMATH Keywords
 
property testing
Property / zbMATH Keywords: property testing / rank
 
Normal rank
Property / zbMATH Keywords
 
convex coloring
Property / zbMATH Keywords: convex coloring / rank
 
Normal rank
Property / zbMATH Keywords
 
sublinear algorithms
Property / zbMATH Keywords: sublinear algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
massively parameterized
Property / zbMATH Keywords: massively parameterized / rank
 
Normal rank
Property / zbMATH Keywords
 
phylogenetic trees
Property / zbMATH Keywords: phylogenetic trees / rank
 
Normal rank
Property / zbMATH Keywords
 
graph algorithms
Property / zbMATH Keywords: graph algorithms / 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.1007/s00453-009-9368-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2041664513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Languages are Testable with a Constant Number of Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-testing/correcting with applications to numerical problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing st-Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3152421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4668732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Query Complexity of Testing Orientations for Being Eulerian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity testing over general poset domains / 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: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Membership in Languages that Have Small Width Branching Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing the diameter of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Characterizations of Polynomials with Applications to Program Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Lowest Common Ancestors: Simplification and Parallelization / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:41, 4 July 2024

scientific article
Language Label Description Also known as
English
Testing convexity properties of tree colorings
scientific article

    Statements

    Testing convexity properties of tree colorings (English)
    0 references
    0 references
    0 references
    0 references
    1 July 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    property testing
    0 references
    convex coloring
    0 references
    sublinear algorithms
    0 references
    massively parameterized
    0 references
    phylogenetic trees
    0 references
    graph algorithms
    0 references
    0 references