Computing maximum independent set on outerstring graphs and their relatives

DOI10.1007/978-3-030-24766-9_16OpenAlexW2964529046MaRDI QIDQ5919310

Saeed Mehrabi, Prosenjit Bose, Mark J. Keil, Paz Carmi, Debajyoti Mondal, Anil Maheshwari, Michiel H. M. Smid

Publication date: 16 January 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1903.07024

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Related Items (2)

Collision-free routing problem with restricted L-path ⋮ Computing maximum independent set on outerstring graphs and their relatives

This page was built for publication: Computing maximum independent set on outerstring graphs and their relatives