Pages that link to "Item:Q1071505"
From MaRDI portal
The following pages link to Decomposing a set of points into chains, with applications to permutation and circle graphs (Q1071505):
Displaying 13 items.
- Untangled monotonic chains and adaptive range search (Q553358) (← links)
- A tutorial on the use of graph coloring for some problems in robotics (Q948648) (← links)
- An \(\Omega\) (n log n) lower bound for decomposing a set of points into chains (Q1124331) (← links)
- Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs (Q1183585) (← links)
- The weighted maximum independent set problem in permutation graphs (Q1195927) (← links)
- Parallel algorithms for permutation graphs (Q1314630) (← links)
- A theorem on permutation graphs with applications (Q1328502) (← links)
- Coloring permutation graphs in parallel (Q1613373) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs (Q1917245) (← links)
- Compressed spaced suffix arrays (Q2363990) (← links)
- Fully dynamic algorithms for permutation graph coloring (Q3123352) (← links)
- Generate all maximal independent sets in permutation graphs (Q4323409) (← links)
