{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1360011146437026432.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"DOI","@value":"10.1016/0925-7721(94)00014-x"}},{"identifier":{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:092577219400014X?httpAccept=text/xml"}},{"identifier":{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:092577219400014X?httpAccept=text/plain"}},{"identifier":{"@type":"NAID","@value":"80007919128"}}],"dc:title":[{"@value":"Algorithms for drawing graphs: an annotated bibliography"}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1380011146437026434","@type":"Researcher","foaf:name":[{"@value":"Giuseppe Di Battista"}]},{"@id":"https://cir.nii.ac.jp/crid/1380011146437026435","@type":"Researcher","foaf:name":[{"@value":"Peter Eades"}]},{"@id":"https://cir.nii.ac.jp/crid/1380011146437026432","@type":"Researcher","foaf:name":[{"@value":"Roberto Tamassia"}]},{"@id":"https://cir.nii.ac.jp/crid/1380011146437026433","@type":"Researcher","foaf:name":[{"@value":"Ioannis G Tollis"}]}],"publication":{"publicationIdentifier":[{"@type":"PISSN","@value":"09257721"}],"prism:publicationName":[{"@value":"Computational Geometry"}],"dc:publisher":[{"@value":"Elsevier BV"}],"prism:publicationDate":"1994-10","prism:volume":"4","prism:number":"5","prism:startingPage":"235","prism:endingPage":"282"},"reviewed":"false","dc:rights":["https://www.elsevier.com/tdm/userlicense/1.0/","https://www.elsevier.com/open-access/userlicense/1.0/"],"url":[{"@id":"https://api.elsevier.com/content/article/PII:092577219400014X?httpAccept=text/xml"},{"@id":"https://api.elsevier.com/content/article/PII:092577219400014X?httpAccept=text/plain"}],"createdAt":"2002-07-26","modifiedAt":"2019-04-13","relatedProduct":[{"@id":"https://cir.nii.ac.jp/crid/1050282677890209280","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@value":"グラフ描画アルゴリズムの性能評価"},{"@language":"ja-Kana","@value":"グラフ ビョウガ アルゴリズム ノ セイノウ ヒョウカ"}]},{"@id":"https://cir.nii.ac.jp/crid/1050282677891453056","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@value":"遺伝的アルゴリズムを用いたグラフ自動描画"},{"@language":"ja-Kana","@value":"イデンテキ アルゴリズム オ モチイタ グラフ ジドウ ビョウガ"}]},{"@id":"https://cir.nii.ac.jp/crid/1050587981426468480","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Characterizing Reaction Route Map of Realistic Molecular Reactions Based on Weight Rank Clique Filtration of Persistent Homology"}]},{"@id":"https://cir.nii.ac.jp/crid/1050587981434133888","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@language":"ja","@value":"ネットワーク構造の局所エネルギー最小化による可視化の高速化"},{"@language":"en","@value":"Fast visualization of the complex network by use of local elastic energy minimization"},{"@language":"ja-Kana","@value":"ネットワーク コウゾウ ノ キョクショ エネルギー サイショウカ ニ ヨル カシカ ノ コウソクカ"}]},{"@id":"https://cir.nii.ac.jp/crid/1050845762815469056","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@value":"2部グラフ描画問題に対する近似アルゴリズム"},{"@language":"en","@value":"An Approximation Algorithm for the Bipartite Graph Drawing Problem"},{"@language":"ja-Kana","@value":"2ブ グラフ ビョウガ モンダイ ニ タイスル キンジ アルゴリズム"}]},{"@id":"https://cir.nii.ac.jp/crid/1360004230571719424","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Deterministic Construction of Regular Geometric Graphs with Short Average Distance and Limited Edge Length"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001206311569536","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Listing All st-Orientations"}]},{"@id":"https://cir.nii.ac.jp/crid/1390282679447607296","@type":"Article","relationType":["isReferencedBy","isCitedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"A Method for Building Spacecraft Operation Products"},{"@language":"ja","@value":"宇宙機向け運用プロダクトの構築手法"},{"@language":"ja-Kana","@value":"ウチュウキ ムケ ウンヨウ プロダクト ノ コウチク シュホウ"}]},{"@id":"https://cir.nii.ac.jp/crid/1390282680742292480","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@language":"ja","@value":"グラフの自動描画"},{"@language":"en","@value":"Automatic Drawings of Graphs"},{"@language":"ja-Kana","@value":"グラフ ノ ジドウ ビョウガ"}]},{"@id":"https://cir.nii.ac.jp/crid/1520009408014996096","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@value":"ユーザ思考支援に基づく学術論文関係図の可視化手法の提案"},{"@language":"ja-Kana","@value":"ユーザ シコウ シエン ニ モトヅク ガクジュツ ロンブン カンケイズ ノ カシカ シュホウ ノ テイアン"}]},{"@id":"https://cir.nii.ac.jp/crid/1520009409529047168","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@value":"Complexity and Completeness of Finding Another Solution and Its Application to Puzzles"},{"@language":"ja-Kana","@value":"Complexity and Completeness of Finding Another Solution and Its Application to Puzzles"}]},{"@id":"https://cir.nii.ac.jp/crid/1520290885263251968","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@value":"Grid Drawings of Four-Connectes Plane Graphs"},{"@language":"ja-Kana","@value":"Grid Drawings of Four-Connectes Plane Graphs"}]},{"@id":"https://cir.nii.ac.jp/crid/1520572357790295424","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@value":"Listing all st-orientations"},{"@language":"ja-Kana","@value":"Listing all st orientations"}]},{"@id":"https://cir.nii.ac.jp/crid/1520853835203942784","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@value":"CONTEC:辺交差の制御機能を有するグラフ描画システム"},{"@language":"ja-Kana","@value":"CONTEC ヘン コウサ ノ セイギョ キノウ オ ユウスル グラフ ビョウガ システム"}]},{"@id":"https://cir.nii.ac.jp/crid/1520853835215238144","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@value":"直交順序を保存する方形の最小面積非交差再配置問題"},{"@language":"ja-Kana","@value":"チョッコウ ジュンジョ オ ホゾン スル ホウケイ ノ サイショウ メンセキ ヒコウサ サイハイチ モンダイ"}]},{"@id":"https://cir.nii.ac.jp/crid/1570291227388248448","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Complexity and Completeness of Finding Another Solution and Its Application to Puzzles"}]},{"@id":"https://cir.nii.ac.jp/crid/1570291227423976064","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@language":"ja","@value":"4連結平面グラフの格子凸描画"},{"@language":"en","@value":"Convex Grid Drawings of Four-Connected Plane Graphs"}]},{"@id":"https://cir.nii.ac.jp/crid/1570291227534658432","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Planar Drawings of Plane Graphs"}]},{"@id":"https://cir.nii.ac.jp/crid/1571417127330179584","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@language":"ja","@value":"直交順序を保存する矩形の非交差再配置問題について"},{"@language":"en","@value":"A Layout Adjustment Problem for Disjoint Rectangles Preserving Orthogonal Order"}]},{"@id":"https://cir.nii.ac.jp/crid/1572261552224599808","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Algorithms for Drawing Plane Graphs"}]},{"@id":"https://cir.nii.ac.jp/crid/1572824500104252032","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@language":"ja","@value":"電力系統図自動表示システムの開発"},{"@language":"en","@value":"A Development Of The System Drawing Power System Diagrams Automatically"}]},{"@id":"https://cir.nii.ac.jp/crid/1572824502023827072","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@language":"ja","@value":"遺伝的アルゴリズムを用いたグラフ自動描画"},{"@language":"en","@value":"Automatically Graph Drawing Using Genetic Algorithm"}]},{"@id":"https://cir.nii.ac.jp/crid/1572824502214003712","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"平面グラフの箱-矩形描画"},{"@language":"en","@value":"Box-Rectangular Drawings of Plane Graphs"}]},{"@id":"https://cir.nii.ac.jp/crid/1573105977000574848","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@language":"ja","@value":"2部グラフ描画に対する近似アルゴリズム"},{"@language":"en","@value":"An approximation algorithm for the bipartite graph drawing problem"}]}],"dataSourceIdentifier":[{"@type":"CROSSREF","@value":"10.1016/0925-7721(94)00014-x"},{"@type":"CIA","@value":"80007919128"},{"@type":"CROSSREF","@value":"10.1007/978-3-319-49583-5_23_references_DOI_IpQ8DSBMiIb0SuYlQZZKMQ8hHmk"},{"@type":"CROSSREF","@value":"10.2322/jjsass.56.186_references_DOI_IpQ8DSBMiIb0SuYlQZZKMQ8hHmk"},{"@type":"CROSSREF","@value":"10.1021/acs.jctc.2c01204_references_DOI_IpQ8DSBMiIb0SuYlQZZKMQ8hHmk"},{"@type":"CROSSREF","@value":"10.1587/transfun.e94.a.1965_references_DOI_IpQ8DSBMiIb0SuYlQZZKMQ8hHmk"}]}