{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,16]],"date-time":"2026-11-16T04:07:20Z","timestamp":1794802040859,"version":"4.9.1"},"reference-count":0,"publisher":"IOS Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"abstract":"<jats:p>Block graphs are graphs in which every block (biconnected component) is a clique. A graph G = (V, E) is said to be an (unpartitioned) k-probe block graph if there exist k independent sets, 1&amp;le;i&amp;le;k, such that the graph G&amp;prime; obtained from G by adding some new edges between certain vertices inside the sets, 1&amp;le;i&amp;le;k, is a block graph; if the independent setsare given, G is called a partitioned k-probe block graph. In this paper we give good characterizations for 2-probe block graphs, in both unpartitioned and partitioned cases. As an algorithmic implication, partitioned and unpartitioned 2-probe block graphs can be recognized in linear time, improving a recognition algorithm of cubic time complexity previously obtained by Chang et al. (2011) in [3].<\/jats:p>","DOI":"10.3233\/978-1-61499-484-8-22","type":"book-chapter","created":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T05:21:00Z","timestamp":1740115260000},"source":"Crossref","is-referenced-by-count":0,"title":["Good characterizations and linear time recognition for 2-probe block graphs"],"prefix":"10.3233","author":[{"family":"Le Van Bang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"family":"Peng Sheng-Lung","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","Intelligent Systems and Applications"],"original-title":[],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T06:00:08Z","timestamp":1740117608000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospressISSNISBN&issn=0922-6389&volume=274&spage=22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/978-1-61499-484-8-22","relation":{"is-cited-by":[{"id-type":"doi","id":"10.1007\/s10878-016-0106-9","asserted-by":"object"},{"id-type":"doi","id":"10.1007\/978-3-319-21398-9_42","asserted-by":"object"}]},"ISSN":["0922-6389"],"issn-type":[{"value":"0922-6389","type":"print"}],"subject":[],"published":{"date-parts":[[2015]]}}}