scientific article; zbMATH DE number 1436135

MaRDI QIDQ4948732zbMATH OpenFDO

Authors Maria I. Andreou, Stavros D. Nikolopoulos

Publication date 26 April 2000

zbMATH Keywords

coloringpermutation graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Coloring permutation graphs in parallel
• Coloring permutation graphs in parallel
• Parallel algorithms for permutation graphs
• Efficient parallel algorithms for permutation graphs

Cited in

(7)

• Decomposing a set of points into chains, with applications to permutation and circle graphs
• Parallel algorithms for permutation graphs
• The permutation-path coloring problem on trees.
• Coloring permutation graphs in parallel
• Coloring permutation graphs in parallel
• Fully dynamic algorithms for permutation graph coloring
• A compact data structure and parallel algorithms for permutation graphs

This page was built for publication:

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