FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2406769913> ?p ?o ?g. }

• W2406769913 endingPage "8" @default.
• W2406769913 startingPage "3" @default.
• W2406769913 abstract "We briefly review some recent findings and outline some emerging research directions about the theory of “nearly planar” graphs, i.e. graphs that have drawings where some crossing configurations are forbidden. 1 Graph drawing beyond planarity Recent technological advances have generated torrents of relational data that are hard to display and visually analyze due, mainly, to their large size. Application domains where this need is particularly pressing include Systems Biology, Social Network Analysis, Software Engineering, and Networking. What is required is not simply an incremental improvement to scale up known solutions but, rather, a quantum jump in the sophistication of the visualization systems and techniques. New research scenarios for visual analytics, network visualization, and human-computer interaction paradigms must be identified; new combinatorial models must be defined and their corresponding theoretical problems must be computationally investigated; finally, the theoretical solutions must be experimentally evaluated and put into practice. Therefore, a substantial research effort in the graph drawing and network visualization communities started from the following considerations. The Planarity Handicap. The classical literature on graph drawing and network visualization showcases elegant algorithms and sophisticated data structures under the assumption that the input relational data set can be displayed as a network where no two edges cross (see, e.g., [14,35,36,40]), i.e. as a planar graph. Unfortunately, almost every graph is non-planar in practice and various experimental studies have established that the human ability of understanding a diagram is dramatically affected by the type and number of edge crossings (see, e.g., [42,43,48]). Combinatorial Topology vs. Algorithmics. A topological graph is a drawing of a graph in the plane such that vertices are drawn as points and edges are drawn as simple arcs between the points. Extremal theory questions such as “how many edges can a certain type of non-planar topological graph have?” have been investigated by mathematicians for decades, typically under the name of Turan-type problems. However, the corresponding computational question: “How efficiently can one compute a drawing Γ of a non-planar graph such that Γ is a topological graph of a certain type?” has been surprisingly disregarded by the algorithmic community until very recent years." @default.
• W2406769913 created "2016-06-24" @default.
• W2406769913 creator A5008995859 @default.
• W2406769913 date "2014-01-01" @default.
• W2406769913 modified "2023-09-26" @default.
• W2406769913 title "Graph drawing beyond planarity: some results and open problems." @default.
• W2406769913 cites W1502938161 @default.
• W2406769913 cites W1507334195 @default.
• W2406769913 cites W1594340659 @default.
• W2406769913 cites W1600348603 @default.
• W2406769913 cites W1648748816 @default.
• W2406769913 cites W165147621 @default.
• W2406769913 cites W1723997437 @default.
• W2406769913 cites W192589467 @default.
• W2406769913 cites W1970282908 @default.
• W2406769913 cites W1976024742 @default.
• W2406769913 cites W1981505946 @default.
• W2406769913 cites W1990163141 @default.
• W2406769913 cites W1999436764 @default.
• W2406769913 cites W2002951193 @default.
• W2406769913 cites W2003525146 @default.
• W2406769913 cites W2016199536 @default.
• W2406769913 cites W2021281967 @default.
• W2406769913 cites W2037942952 @default.
• W2406769913 cites W2040261757 @default.
• W2406769913 cites W2045730620 @default.
• W2406769913 cites W2045737295 @default.
• W2406769913 cites W2046203894 @default.
• W2406769913 cites W2053608598 @default.
• W2406769913 cites W2054401820 @default.
• W2406769913 cites W2057352080 @default.
• W2406769913 cites W2058139201 @default.
• W2406769913 cites W2063563598 @default.
• W2406769913 cites W2080939450 @default.
• W2406769913 cites W2081223146 @default.
• W2406769913 cites W2089630590 @default.
• W2406769913 cites W2091733471 @default.
• W2406769913 cites W2091833930 @default.
• W2406769913 cites W2122778940 @default.
• W2406769913 cites W2134344894 @default.
• W2406769913 cites W2143831227 @default.
• W2406769913 cites W2149888405 @default.
• W2406769913 cites W2151422426 @default.
• W2406769913 cites W2155493403 @default.
• W2406769913 cites W2157479314 @default.
• W2406769913 cites W2162697283 @default.
• W2406769913 cites W2275362914 @default.
• W2406769913 cites W2401601933 @default.
• W2406769913 cites W2761681115 @default.
• W2406769913 cites W2799803339 @default.
• W2406769913 cites W411619626 @default.
• W2406769913 cites W49135760 @default.
• W2406769913 cites W58939658 @default.
• W2406769913 hasPublicationYear "2014" @default.
• W2406769913 type Work @default.
• W2406769913 sameAs 2406769913 @default.
• W2406769913 citedByCount "10" @default.
• W2406769913 countsByYear W24067699132015 @default.
• W2406769913 countsByYear W24067699132016 @default.
• W2406769913 countsByYear W24067699132017 @default.
• W2406769913 countsByYear W24067699132018 @default.
• W2406769913 crossrefType "proceedings-article" @default.
• W2406769913 hasAuthorship W2406769913A5008995859 @default.
• W2406769913 hasConcept C101837359 @default.
• W2406769913 hasConcept C112953755 @default.
• W2406769913 hasConcept C114614502 @default.
• W2406769913 hasConcept C124101348 @default.
• W2406769913 hasConcept C132525143 @default.
• W2406769913 hasConcept C136764020 @default.
• W2406769913 hasConcept C137753397 @default.
• W2406769913 hasConcept C172367668 @default.
• W2406769913 hasConcept C177264268 @default.
• W2406769913 hasConcept C185578843 @default.
• W2406769913 hasConcept C199360897 @default.
• W2406769913 hasConcept C2522767166 @default.
• W2406769913 hasConcept C2911174283 @default.
• W2406769913 hasConcept C33923547 @default.
• W2406769913 hasConcept C34947359 @default.
• W2406769913 hasConcept C36464697 @default.
• W2406769913 hasConcept C41008148 @default.
• W2406769913 hasConcept C68260962 @default.
• W2406769913 hasConcept C80444323 @default.
• W2406769913 hasConceptScore W2406769913C101837359 @default.
• W2406769913 hasConceptScore W2406769913C112953755 @default.
• W2406769913 hasConceptScore W2406769913C114614502 @default.
• W2406769913 hasConceptScore W2406769913C124101348 @default.
• W2406769913 hasConceptScore W2406769913C132525143 @default.
• W2406769913 hasConceptScore W2406769913C136764020 @default.
• W2406769913 hasConceptScore W2406769913C137753397 @default.
• W2406769913 hasConceptScore W2406769913C172367668 @default.
• W2406769913 hasConceptScore W2406769913C177264268 @default.
• W2406769913 hasConceptScore W2406769913C185578843 @default.
• W2406769913 hasConceptScore W2406769913C199360897 @default.
• W2406769913 hasConceptScore W2406769913C2522767166 @default.
• W2406769913 hasConceptScore W2406769913C2911174283 @default.
• W2406769913 hasConceptScore W2406769913C33923547 @default.
• W2406769913 hasConceptScore W2406769913C34947359 @default.
• W2406769913 hasConceptScore W2406769913C36464697 @default.

• next