Algorithms for interval structures with applications
From MaRDI portal
Publication:388095
DOI10.1016/j.tcs.2011.12.075zbMath1325.05163OpenAlexW1998397869MaRDI QIDQ388095
Publication date: 19 December 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.075
Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (6)
Color spanning objects: algorithms and hardness results ⋮ Shortest color-spanning intervals ⋮ Minimum width color spanning annulus ⋮ Color-spanning localized query ⋮ Color Spanning Objects: Algorithms and Hardness Results ⋮ Minimum Width Color Spanning Annulus
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a circle-cover minimization problem
- A linear-time algorithm for a special case of disjoint set union
- Parallel circle-cover algorithms
- A unified approach to domination problems on interval graphs
- An optimal parallel algorithm for the minimum circle-cover problem
- Linear time algorithms on circular-arc graphs
- Preserving order in a forest in less than logarithmic time and linear space
- Finding level-ancestors in trees
- 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
- Free-Form Surface Partition in 3-D
- SMALLEST COLOR-SPANNING OBJECT REVISITED
- An optimal algorithm to solve the all-pair shortest path problem on interval graphs
- Design and implementation of an efficient priority queue
- 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
