The following pages link to (Q3328583):
Displayed 12 items.
- Exact algorithms for intervalizing coloured graphs (Q255264) (← links)
- On the minimum and maximum selective graph coloring problems in some graph classes (Q266810) (← links)
- An optimal algorithm to recognize Robinsonian dissimilarities (Q269174) (← links)
- Heuristics for the network design problem with connectivity requirements (Q281782) (← links)
- Augmenting approach for some maximum set problems (Q284765) (← links)
- Two topics in tree inference: locating a phonological network effect in immediate recall and arborescence partitive set form (Q285951) (← links)
- A linear-time algorithm for the weighted feedback vertex problem on interval graphs (Q286981) (← links)
- An approximation result for a duo-processor task scheduling problem (Q286992) (← links)
- A parallel algorithm for solving the coloring problem on trapezoid graphs (Q287107) (← links)
- A linear time algorithm for finding depth-first spanning trees on trapezoid graphs (Q287118) (← links)
- On-line algorithms for the dominating set problem (Q290186) (← links)
- An approximation algorithm for clustering graphs with dominating diametral path (Q290198) (← links)