Algorithms for Interval Structures with Applications

DOI10.1007/978-3-642-21204-8_23zbMath1329.68278OpenAlexW2180680690MaRDI QIDQ3004669

Danny Z. Chen, Ewa Misiołek

Publication date: 3 June 2011

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21204-8_23

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear time algorithms on circular-arc graphs
• Chromatic nearest neighbor searching: A query sensitive approach
• Algorithmic graph theory and perfect graphs
• An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
• On intersecting a set of parallel line segments with a convex polygon of minimum area
• NP-Completeness of Spreading Colored Points
• Computing Toolpaths for 5-Axis NC Machines
• Computing Minimum Diameter Color-Spanning Sets
• SMALLEST COLOR-SPANNING OBJECT REVISITED
• An optimal algorithm to solve the all-pair shortest path problem on interval graphs
• Solving the all-pair shortest path query problem on interval and circular-arc graphs
• Finding an optimal path without growing the tree
• MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS
• TSP with neighborhoods of varying size
• Automata, Languages and Programming

This page was built for publication: Algorithms for Interval Structures with Applications