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...

全面介紹

Saved in:
書目詳細資料
Main Authors: Ondřej Navrátil, Sanpawat Kantabutra, Sheng Lung Peng
格式: 雜誌
出版: 2020
主題:
在線閱讀:https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85091334609&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/70445
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!