Abstract
Given a class of graphs, , a graph G is a probe graph of if its vertices can be partitioned into two sets, ℙ (the probes) and ℕ (the nonprobes), where ℕ is an independent set, such that G can be embedded into a graph of by adding edges between certain nonprobes. In this paper we study the probe graphs of ptolemaic graphs when the partition of vertices is unknown. We present some characterizations of probe ptolemaic graphs and show that there exists a polynomial-time recognition algorithm for probe ptolemaic graphs. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Chandler, D. B., Chang, M. S., Kloks, T., Le, V. B., & Peng, S. L. (2008). Probe ptolemaic graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5092 LNCS, pp. 468–477). https://doi.org/10.1007/978-3-540-69733-6_46
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
