[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"detail-sidebar-cat-0-en-105":3,"doc-seo-513625-105":59,"doc-detail-513625-en":130},{"code":4,"msg":5,"data":6},0,"success",[7,13,18,23,28,33,38,43,48,51,55],{"id":8,"doc_module":4,"doc_module_name":9,"category_name":10,"show_sort_weight":11,"slug":12},1,"Document","Story & Novel",90,"story-novel",{"id":14,"doc_module":4,"doc_module_name":9,"category_name":15,"show_sort_weight":16,"slug":17},2,"Literature",80,"literature",{"id":19,"doc_module":4,"doc_module_name":9,"category_name":20,"show_sort_weight":21,"slug":22},4,"Exam",70,"exam",{"id":24,"doc_module":4,"doc_module_name":9,"category_name":25,"show_sort_weight":26,"slug":27},5,"Comic",60,"comic",{"id":29,"doc_module":4,"doc_module_name":9,"category_name":30,"show_sort_weight":31,"slug":32},6,"Technology",50,"technology",{"id":34,"doc_module":4,"doc_module_name":9,"category_name":35,"show_sort_weight":36,"slug":37},7,"Healthcare",40,"healthcare",{"id":39,"doc_module":4,"doc_module_name":9,"category_name":40,"show_sort_weight":41,"slug":42},8,"Research & Report",30,"research-report",{"id":44,"doc_module":4,"doc_module_name":9,"category_name":45,"show_sort_weight":46,"slug":47},9,"Religion & Spirituality",20,"religion-spirituality",{"id":46,"doc_module":4,"doc_module_name":9,"category_name":49,"show_sort_weight":46,"slug":50},"World Cup","world-cup",{"id":52,"doc_module":4,"doc_module_name":9,"category_name":53,"show_sort_weight":52,"slug":54},10,"Lifestyle","lifestyle",{"id":56,"doc_module":4,"doc_module_name":9,"category_name":57,"show_sort_weight":24,"slug":58},19,"General","general",{"code":4,"msg":60,"data":61},"ok",{"site_id":62,"language":63,"slug":64,"title":65,"keywords":66,"description":67,"schema_data":68,"social_meta":123,"head_meta":125,"extra_data":127,"updated_unix":129},105,"en","a-bijection-between-realizers-of-maximal-plane-graphs-and-pairs-of-non-crossing-dyck-paths","A Bijection Between Realizers of Maximal Plane Graphs and Pairs of Non-Crossing Dyck Paths","","Schnyder trees (realizers) provide a powerful representation of maximal plane graphs in graph drawing and related encoding tasks. This paper presents a linear-time bijection that transforms realizers of size n into pairs of non-crossing Dyck paths of size 2n−6, and vice versa. The mapping enables both counting the number of realizers of size n and efficiently generating all realizers of that size.",{"@graph":69,"@context":122},[70,84,105],{"@type":71,"itemListElement":72},"BreadcrumbList",[73,77,79,82],{"item":74,"name":75,"@type":76,"position":8},"https://docshare.wps.com","Home","ListItem",{"item":78,"name":9,"@type":76,"position":14},"https://docshare.wps.com/document/",{"item":80,"name":40,"@type":76,"position":81},"https://docshare.wps.com/document/research-report/",3,{"item":83,"name":65,"@type":76,"position":19},"https://docshare.wps.com/document/a-bijection-between-realizers-of-maximal-plane-graphs-and-pairs-of-non-crossing-dyck-paths/513625/",{"url":83,"name":65,"@type":85,"image":86,"author":91,"headline":65,"publisher":94,"fileFormat":97,"inLanguage":63,"description":67,"dateModified":98,"datePublished":99,"encodingFormat":97,"isAccessibleForFree":100,"interactionStatistic":101},"DigitalDocument",{"url":87,"@type":88,"width":89,"height":90},"https://docshare.wps.com/thumbnails/a-bijection-between-realizers-of-maximal-plane-graphs-and-pairs-of-non-crossing-dyck-paths/513625.png","ImageObject",300,407,{"name":92,"@type":93},"awa","Person",{"url":74,"name":95,"@type":96},"DocShare","Organization","application/pdf","2026-11-11","2026-10-06",true,{"@type":102,"interactionType":103,"userInteractionCount":39},"InteractionCounter",{"@type":104},"ViewAction",{"@type":106,"mainEntity":107},"FAQPage",[108,114,118],{"name":109,"@type":110,"acceptedAnswer":111},"What is the main contribution of the paper?","Question",{"text":112,"@type":113},"The paper proposes a bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths, including a linear-time conversion in both directions.","Answer",{"name":115,"@type":110,"acceptedAnswer":116},"How are realizers transformed into Dyck paths?",{"text":117,"@type":113},"Each realizer is associated with a star realizer and a prefix flip sequence; both structures are encoded using two Dyck paths whose relationship enforces non-crossing.",{"name":119,"@type":110,"acceptedAnswer":120},"What problem does the bijection help solve?",{"text":121,"@type":113},"It allows the authors to enumerate the number of realizers of size n and to efficiently generate all realizers of that size.","https://schema.org",{"og:url":83,"og:type":124,"og:title":65,"og:site_name":95,"og:description":67},"article",{"robots":126,"canonical":83},"index,follow",{"doc_id":128,"site_id":62},513625,1791481177,{"code":4,"msg":5,"data":131},{"doc_id":128,"user_id":132,"nickname":92,"user_avatar":133,"doc_module":4,"category_id":39,"category_name":40,"doc_title":65,"doc_description":67,"doc_content":134,"file_id":135,"file_url":136,"file_type":137,"file_size":138,"view_count":39,"is_deleted":4,"is_public":8,"is_downloadable":8,"audit_status":8,"page_count":52,"language":139,"language_code":63,"site_id":62,"html_lang":63,"table_of_contents":140,"faqs":141,"seo_title":142,"seo_description":67,"update_tm":143,"read_time":144,"preview_page_count":19,"preview_urls":145},3985747858093,"https://ap-avatar.wpscdn.com/davatar_3d24733baf745e90a7e4bdd5f77d97b2","# A BIJECTION BETWEEN REALIZERS OF MAXIMAL PLANEGRAPHS AND PAIRS OF NON-CROSSING DYCK PATHS\n\nNICOLAS BONICHON  \nABSTRACT.Schnyder trees,or realizers,of maximal plane graphs,are widely used inthe graph drawing domain.In this paper,a bijection between realizers and pairs ofnon-crossing Dyck paths is proposed.The transformation of a realizer into a pair of non-crossing Dyck paths and the opposite operation can be done in linear time.Applying thisbijection,we enumerate the number of realizers of size n and we can efficiently generateall of them.  \nRÉSUMÉ.Les arbres de Schnyder,ou realiseurs,d’un graphe maximal planaire,sont large-ment répandus dans le domaine du dessin de graphe.Nous proposons ici,une bijectionentre les réaliseurs et les paires de chemins de Dyck qui ne se coupent pas.La transforma-tion dun réaliseur en une paire de chemin de Dyck et son inverse se font en temps lineaire.Utilisant cette bijection,nous pouvons énumérer les realiseurs de taille n et nous pouvonsles générer exhaustivement de manière efficace.  \n## 1.INTRODUCTION\n\nSchnyder showed that every maximal plane graph admits a special decomposition of itsinterior edges into three trees(see Fig.2),called a realizer [16,17].Such decompositioncan be constructed in linear time [17].Using realizers,it has been proved in[17]that everyplane graph with n≥3 vertices has a planar straight-line drawing in a rectangular gridarea (n-2)×(n-2).  \nRealizers are useful for many graph algorithms,of course for graph drawing [17,4,1,13]but also for graph encoding [5].They are linked to canonical orderings (or shelling orders)  \n[9,14],with 3-orientations [6],and with orderly spanning trees [4].They can also be usedto characterize planar graphs in terms of the order of their incidence,i.e.,a graph G isplanar iff the dimension of the incidence order of vertices and edges is at most 3[16].  \nRealizers of the same graph have already been investigated [6,3].Suitable operationstransforming a realizer of a graph to another realizer of the same graph have been introduced[3].A particular normal form is also characterized.Moreover,the structure of the setof realizers of a given graph turns out to be a distributive lattice [6,3].Operations onrealizers of same size have also been investigated.In [18]diagonal flip operations have beenintroduced.For all the maximal planar graphs in 2],colored diagonal flip operations onrealizers have been proposed.  \nHere,we deal with realizers of size n,i.e.realizers of maximal plane graphs of size n.The main motivations are the following:how many realizers of size n are there and howcan they be generated.To answer these two questions,a bijection between realizers of sizen and pairs of non-crossing Dyck paths of size 2n-6 is proposed.  \nA Dyck path of size 2n is a path in the discrete plane that starts from the point(0,0)and ends at the point (2n,O).It is composed of length sqrt(2)elementary steps North-Eastand South-East such that it stays in the positive quarter of the plane.(f,g)is a pair ofnon-crossing Dyck paths if g never goes below f.Such paths have been studied by D.Gouyou-Beauchamps [10,11].Pairs of non-crossing Dyck paths are a particular case of  \nN.BONICHON  \nvicious walkers [8,7,12,15].In [10],the number of pairs of non-crossing Dyck paths oflength 2n is calculated:,where Cn is the Catalan number  \nThe principle of the bijection is the following.To each realizer R we can associate aparticular realizer Rc,called star realizer.A star realizer is a realizer in which the thirdtree is a star i.e.all the inner vertices are children of the root.A realizer R is totallydefined by its associated star realizer Rcand a particular sequence of flips,called a prefiarfip sequence,which transforms Rcinto R.The star realizer and the prefix flip sequencecan be encoded by two non-crossing Dyck paths of size 2n-6,where n is the size of therealizer.The star realizer is totally defined by its first tree To.To is encoded by a Dyckpath.The prefix flip sequence is encode","cbCairP8yPFDzmH5","https://ap.wps.com/l/cbCairP8yPFDzmH5","pdf",473174,"English","# Introduction\n## Realizers","[{\"question\":\"What is the main contribution of the paper?\",\"answer\":\"The paper proposes a bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths, including a linear-time conversion in both directions.\"},{\"question\":\"How are realizers transformed into Dyck paths?\",\"answer\":\"Each realizer is associated with a star realizer and a prefix flip sequence; both structures are encoded using two Dyck paths whose relationship enforces non-crossing.\"},{\"question\":\"What problem does the bijection help solve?\",\"answer\":\"It allows the authors to enumerate the number of realizers of size n and to efficiently generate all realizers of that size.\"}]","A Bijection Between Realizers of Maximal Plane Graphs and Pairs of Non-Crossing Dyck Paths | PDF",1791288225,25,[146,150,154,158],{"page_no":8,"url":147,"width":148,"height":149},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-17/d1eaca2a1662b88a8654af73f1220a45.webp",983,1390,{"page_no":14,"url":151,"width":152,"height":153},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-17/b847a9a71230f30c72aacd8ba2713e8f.webp",982,1389,{"page_no":81,"url":155,"width":156,"height":157},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-17/11434a7b58b6db0db5a7ca143c92e45e.webp",981,1387,{"page_no":19,"url":159,"width":160,"height":161},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-17/2e391ca3aadca4e84244351a84a28b06.webp",980,1386]