Measuring the Similarity of Geometric Graphs

被引:0
|
作者
Cheong, Otfried [1 ]
Gudmundsson, Joachim [2 ]
Kim, Hyo-Sil [1 ]
Schymura, Daria [3 ]
Stehn, Fabian [3 ]
机构
[1] Korea Adv Inst Sci & Technol, Taejon, South Korea
[2] NICTA, Canberra, ACT 2601, Australia
[3] Free Univ Berlin, Berlin, Germany
来源
EXPERIMENTAL ALGORITHMS, PROCEEDINGS | 2009年 / 5526卷
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
What does it mean for two geometric graphs to be similar? We propose a distance for geometric graphs that we show to be a metric, and that can be computed by solving an integer linear program. We also present experiments using a heuristic distance function.
引用
收藏
页码:101 / +
页数:2
相关论文
共 50 条
  • [31] On additively geometric graphs
    Arumugam, S.
    Germina, K.A.
    Anandavally, T.M.K.
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2009, 70 : 207 - 216
  • [32] Posets of geometric graphs
    Boutin, Debra L.
    Cockburn, Sally
    Dean, Alice M.
    Margea, Andrei M.
    ARS MATHEMATICA CONTEMPORANEA, 2012, 5 (02) : 269 - 288
  • [33] Generalizing geometric graphs
    1600, Brown University (18):
  • [34] Geometric characterisation of graphs
    Xiao, B
    Hancock, ER
    IMAGE ANALYSIS AND PROCESSING - ICIAP 2005, PROCEEDINGS, 2005, 3617 : 471 - 478
  • [35] Cores of Geometric Graphs
    Godsil, Chris
    Royle, Gordon F.
    ANNALS OF COMBINATORICS, 2011, 15 (02) : 267 - 276
  • [36] Random geometric graphs
    Dall, J
    Christensen, M
    PHYSICAL REVIEW E, 2002, 66 (01)
  • [37] Distinguishing geometric graphs
    Albertson, Michael O.
    Boutin, Debra L.
    JOURNAL OF GRAPH THEORY, 2006, 53 (02) : 135 - 150
  • [38] Geometric Labeled Graphs
    Hegde, S.
    Shankaran, P.
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2008, 5 (01) : 83 - 97
  • [39] Geometric representations of graphs
    Lovász, L
    Vesztergombi, K
    PAUL ERDOS AND HIS MATHEMATICS II, 2002, 11 : 471 - 498
  • [40] Geometric Protean Graphs
    Bonato, Anthony
    Janssen, Jeannette
    Pralat, Pawe L.
    INTERNET MATHEMATICS, 2012, 8 (1-2) : 2 - 28