MAXIMUM INDEPENDENT SET OF A PERMUTATION GRAPH IN K TRACKS

DOI10.1142/S021819599300018XzbMATH Open0804.68100OpenAlexW2096001658MaRDI QIDQ4294716FDOQ4294716

Authors:

Publication date: 1993

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s021819599300018x

Recommendations

• Finding a maximum independent set in a permutation graph
• Maximum weightk-independent set problem on permutation graphs
• Maximal k-independent sets in graphs
• The number of maximum independent sets in graphs
• The weighted maximum independent set problem in permutation graphs
• Generate all maximal independent sets in permutation graphs
• On the number of maximum independent sets of graphs
• On the number of maximal independent sets in a graph
• Maximizing the number of independent sets of fixed size in connected graphs with given independence number
• Maximizing the number of independent sets of fixed size in Kn‐covered graphs

zbMATH Keywords

maximum independent setpermutation graphstrack assignmentmaximum chainplane sweep technique

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

This page was built for publication: MAXIMUM INDEPENDENT SET OF A PERMUTATION GRAPH IN K TRACKS

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