Testing Convexity Properties of Tree Colorings

DOI10.1007/978-3-540-70918-3_10zbMATH Open1186.68337OpenAlexW2108903713MaRDI QIDQ3590927FDOQ3590927

Authors: Eldar Fischer, Orly Yahalom 

Publication date: 3 September 2007

Published in: STACS 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70918-3_10

Recommendations

• Testing convexity properties of tree colorings
• Algorithms and Data Structures
• Convex recolorings of strings and trees: Definitions, hardness results and algorithms
• Efficient approximation of convex recolorings
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cited In (3)

• Testing convexity properties of tree colorings
• A property tester for tree-likeness of quartet topologies
• On the Query Complexity of Testing Orientations for Being Eulerian

This page was built for publication: Testing Convexity Properties of Tree Colorings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3590927)