On phalanx graph search number

© 2020 Taiwan Academic Network Management Committee. All rights reserved. We introduce an extension of the Connected Graph Search, called Phalanx Graph Search, which inherently emerges from the nature of certain applications. We discuss its key properties, prove NP-hardness of the problem on general...

Full description

Saved in:
Bibliographic Details
Main Authors: Ondřej Navrátil, Sanpawat Kantabutra, Sheng Lung Peng
Format: Journal
Published: 2020
Subjects:
Online Access:https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85091334609&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/70445
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Chiang Mai University
Be the first to leave a comment!
You must be logged in first