License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2023.77
URN: urn:nbn:de:0030-drops-186118
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/18611/
Go to the corresponding LIPIcs Volume Portal

Rong, Guozhen ; Yang, Yongjie ; Li, Wenjun

A Polynomial-Time Algorithm for MCS Partial Search Order on Chordal Graphs

pdf-format:
LIPIcs-MFCS-2023-77.pdf (0.8 MB)

Abstract

We study the partial search order problem (PSOP) proposed recently by Scheffler [WG 2022]. Given a graph G together with a partial order on the set of vertices of G, this problem determines if there is an ?-ordering that is consistent with the given partial order, where ? is a graph search paradigm like BFS, DFS, etc. This problem naturally generalizes the end-vertex problem which has received much attention over the past few years. It also generalizes the so-called ℱ-tree recognition problem which has just been studied in the literature recently. Our main contribution is a polynomial-time dynamic programming algorithm for the PSOP of the maximum cardinality search (MCS) restricted to chordal graphs. This resolves one of the most intriguing open questions left in the work of Scheffler [WG 2022]. To obtain our result, we propose the notion of layer structure and study numerous related structural properties which might be of independent interest.

BibTeX - Entry

@InProceedings{rong_et_al:LIPIcs.MFCS.2023.77,
  author =	{Rong, Guozhen and Yang, Yongjie and Li, Wenjun},
  title =	{{A Polynomial-Time Algorithm for MCS Partial Search Order on Chordal Graphs}},
  booktitle =	{48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)},
  pages =	{77:1--77:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-292-1},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{272},
  editor =	{Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2023/18611},
  URN =		{urn:nbn:de:0030-drops-186118},
  doi =		{10.4230/LIPIcs.MFCS.2023.77},
  annote =	{Keywords: partial search order, maximum cardinality search, chordal graphs, clique graphs, dynamic programming}
}

Keywords: partial search order, maximum cardinality search, chordal graphs, clique graphs, dynamic programming
Collection: 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
Issue Date: 2023
Date of publication: 21.08.2023

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI