Fast recognition of subclasses of almost-median graphsImrich, Wilfried (Avtor) Lipovec, Alenka (Avtor) Peterin, Iztok (Avtor) Žigert Pleteršek, Petra (Avtor) matematikateorija grafovskoraj medianski grafialgoritemmathematicsgraph theoryalmost-median graphsalgorithmouterplanar graphsIn this paper it is shown that a class of almost-median graphs that includes all planar almost-median graphs can be recognized in ▫$O(mlog n)$▫ time, where ▫$n$▫ denotes the number of vertices and ▫$m$▫ the number of edges. Moreover, planar almost-median graphs can be recognized in linear time. As a key auxiliary result we prove that all bipartite outerplanar graphs are isometric subgraphs of the hypercube and that the embedding can be effected in linear time.20072015-07-10 14:55:51Članek v reviji51566UDK: 519.17OceCobissID: 1118479COBISS_ID: 14180697DOI: 10.1016/j.disc.2006.07.011ISSN pri članku: 0012-365XNUK URN: URN:SI:UM:DK:J5MW7BVAsl