Reprint of: Upward planar embedding of an n-vertex oriented path on O(n2) points

We prove that every n-vertex oriented path admits an upward planar embedding on every general set of (n−1)2+1 points on the plane. This result improves the previously known upper bound which is exponential in the number of switches of the given oriented path (Angelini et al. 2010) [1].

Saved in:
Bibliographic Details
Published inComputational geometry : theory and applications Vol. 47; no. 3; pp. 493 - 498
Main Author Mchedlidze, Tamara
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.04.2014
Subjects
Oriented path
Universal point set
Upward point-set embedding
Universal point set
Upward point-set embedding
Oriented path
Online AccessGet full text

Cover

Abstract We prove that every n-vertex oriented path admits an upward planar embedding on every general set of (n−1)2+1 points on the plane. This result improves the previously known upper bound which is exponential in the number of switches of the given oriented path (Angelini et al. 2010) [1].
AbstractList We prove that every n-vertex oriented path admits an upward planar embedding on every general set of (n−1)2+1 points on the plane. This result improves the previously known upper bound which is exponential in the number of switches of the given oriented path (Angelini et al. 2010) [1].
Author Mchedlidze, Tamara
Author_xml – sequence: 1
  givenname: Tamara
  surname: Mchedlidze
  fullname: Mchedlidze, Tamara
  email: mched@iti.uka.de
  organization: Faculty of Informatics, Karlsruhe Institute of Technology (KIT), Germany
BookMark eNp9kD9PwzAUxD0UibbwDRg8wpDgZ8dJw4CEKv5JlYoQnS3HfimpWjuyowLfHldhZnrDvTvd_WZk4rxDQq6A5cCgvN3lxh-26HPOQOQAOWPVhExZzWVWVRzOySzGHWOMc1lPyds79qFzA_XtHd30XzpY2u-104HioUFrO7dNGtWOuuyIYcBv6kOHbsD0qIdP6h1dXzt-Q3ufcuIFOWv1PuLl352TzdPjx_IlW62fX5cPq8wIVg6ZkQbqRYGppbYaq6KSsga-QMTaVgKgKMpWlBJ0yRorsGISi5IbvmhQNNCIOSnGXBN8jAFblXYcdPhRwNSJhNqpkYQ6kVAAKpFItvvRhqnbscOgoklrDNouoBmU9d3_Ab8oPWv4
CitedBy_id crossref_primary_10_1093_comjnl_bxv082
Cites_doi 10.1006/jctb.1999.1945
10.1016/j.comgeo.2009.07.002
10.1090/S0002-9947-1986-0837805-6
10.1016/0095-8956(72)90035-4
10.2307/2323956
10.1007/BF02187887
ContentType Journal Article
Copyright 2013
Copyright_xml – notice: 2013
DBID 6I.
AAFTH
AAYXX
CITATION
DOI 10.1016/j.comgeo.2013.11.007
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EndPage 498
ExternalDocumentID 10_1016_j_comgeo_2013_11_007
S0925772113001648
GroupedDBID --K
--M
-DZ
.DC
.~1
0R~
1B1
1RT
1~.
1~5
29F
4.4
457
4G.
5GY
5VS
6I.
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABAOU
ABBOA
ABFNM
ABMAC
ABVKL
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADMUD
AEBSH
AEKER
AEXQZ
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CS3
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
GBOLZ
HVGLF
HZ~
IHE
IXB
J1W
KOM
LG9
M26
M41
MHUIS
MO0
N9A
NCXOZ
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
RNS
ROL
RPZ
SDF
SDG
SDP
SES
SEW
SPC
SPCBC
SSV
SSW
SSZ
T5K
UHS
WUQ
XPP
ZMT
~G-
0SF
AAXKI
AAYXX
ADVLN
AFJKZ
CITATION
ID FETCH-LOGICAL-c306t-c5c1984e201adae747559128eee9d7311446f3651a60bd3e705e462c28be3b1b3
IEDL.DBID IXB
ISSN 0925-7721
IngestDate Thu Sep 26 19:32:36 EDT 2024
Fri Feb 23 02:17:37 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 3
Keywords Universal point set
Upward point-set embedding
Oriented path
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c306t-c5c1984e201adae747559128eee9d7311446f3651a60bd3e705e462c28be3b1b3
OpenAccessLink https://www.sciencedirect.com/science/article/pii/S0925772113001648
PageCount 6
ParticipantIDs crossref_primary_10_1016_j_comgeo_2013_11_007
elsevier_sciencedirect_doi_10_1016_j_comgeo_2013_11_007
PublicationCentury 2000
PublicationDate 2014-04-01
PublicationDateYYYYMMDD 2014-04-01
PublicationDate_xml – month: 04
  year: 2014
  text: 2014-04-01
  day: 01
PublicationDecade 2010
PublicationTitle Computational geometry : theory and applications
PublicationYear 2014
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Jørgen Bang-Jensen, Gregory Gutin, Paths, trees and cycles in tournaments, Technical report.
Rosenfeld (br0090) 1972; 12
Kaufmann, Mchedlidze, Symvonis (br0080) 2011
Thomason (br0100) 1986; 296
Binucci, Di Giacomo, Didimo, Estrella-Balderrama, Frati, Kobourov, Liotta (br0030) 2010; 43
Geyer, Kaufmann, Mchedlidze, Symvonis (br0040) 2011
Gritzmann, Mohar, Pach, Pollack (br0050) 1991; 98
Angelini, Frati, Geyer, Kaufmann, Mchedlidze, Symvonis (br0010) 2010
Hayward (br0070) 1987; 2
Havet, Thomasse (br0060) 2000; 78
Havet (10.1016/j.comgeo.2013.11.007_br0060) 2000; 78
Rosenfeld (10.1016/j.comgeo.2013.11.007_br0090) 1972; 12
Hayward (10.1016/j.comgeo.2013.11.007_br0070) 1987; 2
Gritzmann (10.1016/j.comgeo.2013.11.007_br0050) 1991; 98
Kaufmann (10.1016/j.comgeo.2013.11.007_br0080) 2011
Geyer (10.1016/j.comgeo.2013.11.007_br0040) 2011
Angelini (10.1016/j.comgeo.2013.11.007_br0010) 2010
10.1016/j.comgeo.2013.11.007_br0020
Binucci (10.1016/j.comgeo.2013.11.007_br0030) 2010; 43
Thomason (10.1016/j.comgeo.2013.11.007_br0100) 1986; 296
References_xml – volume: 2
  start-page: 327
  year: 1987
  end-page: 343
  ident: br0070
  article-title: A lower bound for the optimal crossing-free hamiltonian cycle problem
  publication-title: Discrete & Computational Geometry
  contributor:
    fullname: Hayward
– volume: 78
  start-page: 243
  year: 2000
  end-page: 273
  ident: br0060
  article-title: Oriented hamiltonian paths in tournaments: A proof of Rosenfeldʼs conjecture
  publication-title: Journal of Combinatorial Theory Series B
  contributor:
    fullname: Thomasse
– start-page: 25
  year: 2010
  end-page: 37
  ident: br0010
  article-title: Upward geometric graph embeddings into point sets
  publication-title: 18th International Symposium on Graph Drawing (GDʼ10)
  contributor:
    fullname: Symvonis
– start-page: 403
  year: 2011
  end-page: 414
  ident: br0080
  article-title: Upward point set embeddability for convex point sets is in P
  publication-title: 19th International Symposium on Graph Drawing (GD ʼ11)
  contributor:
    fullname: Symvonis
– volume: 12
  start-page: 93
  year: 1972
  end-page: 99
  ident: br0090
  article-title: Antidirected hamiltonian paths in tournaments
  publication-title: Journal of Combinatorial Theory Series B
  contributor:
    fullname: Rosenfeld
– volume: 98
  start-page: 165
  year: 1991
  end-page: 166
  ident: br0050
  article-title: Embedding a planar triangulation with vertices at specified points
  publication-title: The American Mathematical Monthly
  contributor:
    fullname: Pollack
– start-page: 272
  year: 2011
  end-page: 283
  ident: br0040
  article-title: Upward point-set embeddability
  publication-title: 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEMʼ11)
  contributor:
    fullname: Symvonis
– volume: 296
  start-page: 167
  year: 1986
  end-page: 180
  ident: br0100
  article-title: Paths and cycles in tournaments
  publication-title: Transactions of the American Mathematical Society
  contributor:
    fullname: Thomason
– volume: 43
  start-page: 219
  year: 2010
  end-page: 232
  ident: br0030
  article-title: Upward straight-line embeddings of directed graphs into point sets
  publication-title: Computational Geometry
  contributor:
    fullname: Liotta
– volume: 78
  start-page: 243
  issue: 2
  year: 2000
  ident: 10.1016/j.comgeo.2013.11.007_br0060
  article-title: Oriented hamiltonian paths in tournaments: A proof of Rosenfeldʼs conjecture
  publication-title: Journal of Combinatorial Theory Series B
  doi: 10.1006/jctb.1999.1945
  contributor:
    fullname: Havet
– volume: 43
  start-page: 219
  year: 2010
  ident: 10.1016/j.comgeo.2013.11.007_br0030
  article-title: Upward straight-line embeddings of directed graphs into point sets
  publication-title: Computational Geometry
  doi: 10.1016/j.comgeo.2009.07.002
  contributor:
    fullname: Binucci
– volume: 296
  start-page: 167
  year: 1986
  ident: 10.1016/j.comgeo.2013.11.007_br0100
  article-title: Paths and cycles in tournaments
  publication-title: Transactions of the American Mathematical Society
  doi: 10.1090/S0002-9947-1986-0837805-6
  contributor:
    fullname: Thomason
– start-page: 25
  year: 2010
  ident: 10.1016/j.comgeo.2013.11.007_br0010
  article-title: Upward geometric graph embeddings into point sets
  contributor:
    fullname: Angelini
– ident: 10.1016/j.comgeo.2013.11.007_br0020
– start-page: 403
  year: 2011
  ident: 10.1016/j.comgeo.2013.11.007_br0080
  article-title: Upward point set embeddability for convex point sets is in P
  contributor:
    fullname: Kaufmann
– volume: 12
  start-page: 93
  year: 1972
  ident: 10.1016/j.comgeo.2013.11.007_br0090
  article-title: Antidirected hamiltonian paths in tournaments
  publication-title: Journal of Combinatorial Theory Series B
  doi: 10.1016/0095-8956(72)90035-4
  contributor:
    fullname: Rosenfeld
– start-page: 272
  year: 2011
  ident: 10.1016/j.comgeo.2013.11.007_br0040
  article-title: Upward point-set embeddability
  contributor:
    fullname: Geyer
– volume: 98
  start-page: 165
  year: 1991
  ident: 10.1016/j.comgeo.2013.11.007_br0050
  article-title: Embedding a planar triangulation with vertices at specified points
  publication-title: The American Mathematical Monthly
  doi: 10.2307/2323956
  contributor:
    fullname: Gritzmann
– volume: 2
  start-page: 327
  year: 1987
  ident: 10.1016/j.comgeo.2013.11.007_br0070
  article-title: A lower bound for the optimal crossing-free hamiltonian cycle problem
  publication-title: Discrete & Computational Geometry
  doi: 10.1007/BF02187887
  contributor:
    fullname: Hayward
SSID ssj0002259
Score 2.0558379
Snippet We prove that every n-vertex oriented path admits an upward planar embedding on every general set of (n−1)2+1 points on the plane. This result improves the...
SourceID crossref
elsevier
SourceType Aggregation Database
Publisher
StartPage 493
SubjectTerms Oriented path
Universal point set
Upward point-set embedding
Title Reprint of: Upward planar embedding of an n-vertex oriented path on O(n2) points
URI https://dx.doi.org/10.1016/j.comgeo.2013.11.007
Volume 47
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3JTsMwELVKucABsYqyVD5wgINp0uzcoAIVyiagqLfIjieoCJyoLRInvp2ZLAgkxIGTlcVW8jyaxZp5w9heGkXgqBQEpIEv3FRGIky0FnbiygBUakWKDvSvrv3-0L0YeaMG69W1MJRWWen-UqcX2rq606nQ7OTjcefeilDcKIBxCp4oKvglbk8q4hudfGljlNeSb4_atuLbdflckeOFaz8VJYC2c0hcntRU9jfz9M3knC2zpcpX5Mfl56ywBphVtnj1RbQ6XWO36EBPxmbGs_SID3NKgeX5izRywuFVgSbLhM-4NNwIar0M7zwjamN0NDl1I-aZ4Tf7pnvA8wzXma6z4dnpQ68vqiYJIkFvfyYSL7Gj0AX8B6klYHSAMQIaHQCIdODYFO-lju_Z0reUdiCwPHD9btINFW6SrZwN1jSZgU3GUx1KFQbKBVu6XStRiQpwcdCe5etQuS0mamzivOTCiOsksee4xDImLDGsiBHLFgtqAOMfexqjuv5z5ta_Z26zBbyqcmt2WHM2eYNddBtmqs3mDj_sNps_PnkcXNLYu7u8pfF80L9uF1LzCb3Mxq8
link.rule.ids 315,786,790,3525,4521,24144,27602,27957,27958,45620,45698,45714,45909
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEB60HtSD-MT63IMHPaxNms3LWxGlPloFW-gt7GYnUtFNaCv4851tElEQD16zzJB8O8wjzHwDcJLFMXoqQ45ZGHCRyZhHqdbcTYUMUWVOrOwP_V4_6A7F7cgfLcBlPQtj2yor31_69Lm3rp60KjRbxXjcenJiMjdbwHhznqhoEZaEH7qiAUudm7tu_8shk8mWlHt2cysJ1BN08zYvUv88nwJ0vXNL52n3yv4Wob5Fnet1WKvSRdYp32gDFtBswmrvi2t1ugWPlENPxmbG8uyCDQvbBcuKV2nkhOGbQm2DE50xaZjhdvsyfrDcshtTrsnsQmKWG_ZwatpnrMhJz3QbhtdXg8sur_Yk8JQS_hlP_dSNI4H0DVJLpAKBygSKO4gY69BzbcmXeYHvysBR2sPQ8VEE7bQdKbonV3k70DC5wV1gmY6kikIl0JWi7aQqVSEpR-07gY6UaAKvsUmKkg4jqfvEXpISy8RiSZVFQlg2IawBTH5ca0Ie-0_JvX9LHsNyd9C7T-5v-nf7sEInVavNATRmk3c8pCxipo4qK_kEk7jFMA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Reprint+of%3A+Upward+planar+embedding+of+an+n+-vertex+oriented+path+on+O+%28+n+2+%29+points&rft.jtitle=Computational+geometry+%3A+theory+and+applications&rft.au=Mchedlidze%2C+Tamara&rft.date=2014-04-01&rft.issn=0925-7721&rft.volume=47&rft.issue=3&rft.spage=493&rft.epage=498&rft_id=info:doi/10.1016%2Fj.comgeo.2013.11.007&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_comgeo_2013_11_007
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0925-7721&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0925-7721&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0925-7721&client=summon