Recognizing median graphs in subquadratic time

被引：16

作者：

Hagauer, J

Imrich, W ^{[1
]}

Klavzar, S

机构：

[1] Montan Univ Leoben, Inst Math & Angew Geometrie, A-8700 Leoben, Austria

[2] Graz Tech Univ, IGI, A-8010 Graz, Austria

[3] Univ Maribor, PEF, Dept Math, SLO-2000 Maribor, Slovenia

来源：

THEORETICAL COMPUTER SCIENCE | 1999年 / 215卷 / 1-2期

关键词：

D O I：

10.1016/S0304-3975(97)00136-9

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Motivated by a dynamic location problem for graphs, Chung, Graham and Saks introduced a graph parameter called winder. Graphs of winder 2 turned out to be, in graph-theoretic language, retracts of hypercubes. These graphs are also known as median graphs and can be characterized as partial binary Hamming graphs satisfying a convexity condition. In this paper an O(n(3/2) log n) algorithm is presented to recognize these graphs. As a by-product we are also able to isometrically embed median graphs in hypercubes in O(m log n) time. (C) 1999-Elsevier Science B.V. All rights reserved.

引用

页码：123 / 136

页数：14

共 50 条

[1] Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs
Pierre Bergé
Guillaume Ducoffe
Michel Habib
[J]. Theory of Computing Systems, 2024, 68 : 144 - 193
[2] Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs
Berge, Pierre
Ducoffe, Guillaume
Habib, Michel
[J]. THEORY OF COMPUTING SYSTEMS, 2024, 68 (01) : 144 - 193
[3] Recognizing pseudo-median graphs
Vesel, A
[J]. DISCRETE APPLIED MATHEMATICS, 2002, 116 (03) : 261 - 269
[4] Generating Random Hyperbolic Graphs in Subquadratic Time
von Looz, Moritz
Meyerhenke, Henning
Prutkin, Roman
[J]. ALGORITHMS AND COMPUTATION, ISAAC 2015, 2015, 9472 : 467 - 478
[5] Constant Girth Approximation for Directed Graphs in Subquadratic Time
Chechik, Shiri
Liu, Yang P.
Rotem, Omer
Sidford, Aaron
[J]. PROCEEDINGS OF THE 52ND ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '20), 2020, : 1010 - 1023
[6] Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time
Wulff-Nilsen, Christian
[J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2013, 46 (07): : 831 - 838
[7] Recognizing hyperelliptic graphs in polynomial time
Bodewes, Jelco M.
Bodlaender, Hans L.
Cornelissen, Gunther
van der Wegen, Marieke
[J]. THEORETICAL COMPUTER SCIENCE, 2020, 815 : 121 - 146
[8] RECOGNIZING OUTERPLANAR GRAPHS IN LINEAR TIME
WIEGERS, M
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1987, 246 : 165 - 176
[9] On median graphs and median grid graphs
Klavzar, S
Skrekovski, R
[J]. DISCRETE MATHEMATICS, 2000, 219 (1-3) : 287 - 293
[10] Recognizing Hamming graphs in linear time and space
Imrich, W
Klavzar, S
[J]. INFORMATION PROCESSING LETTERS, 1997, 63 (02) : 91 - 95

← 1 2 3 4 5 →