FRINK Linked Data Fragments server

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

• W2914448900 abstract "Author(s): Gupta, Siddharth | Advisor(s): Eppstein, David; Goodrich, Michael T | Abstract: We study some geographic and geometric graphs namely road networks and clustered graphs from topological viewpoint, i.e., we consider them as embedded graphs, graphs in which the ordering of edges (clockwise or anti-clockwise) incident on each vertex is uniquely defined. A road network is a graph with a vertex at each intersection of roads and an edge for each segment of road between the intersections. A clustered graph is a graph whose vertices belong to properly nested clusters. We present algorithms and models for some problems related to road networks and clustered graphs.The first problem we consider is how a road network has evolved over time, given two snapshots from different dates. These graph can also have geometric/geographic information, such as the GPS coordinates of some vertices or labels identifying road names. As there can be vertices and edges without such geometric/geographic information, we take a strictly topological approach for the problem. We propose an algorithm, which runs in polynomial time for non degenerate-road networks, and outputs portions of the network that remained intact and also points out added or removed portions. We also analyze our algorithm experimentally taking US road network data from the TIGER/Line archive of the U.S. Census Bureau as input data set and show that our algorithm produces good results in practice.In the second problem, we study the non-planar properties of road networks. We normally consider road networks as planar graph but they are actually non-planar due to non-intersecting crossings caused by overpass, underpass, or tunnel. We provide a mathematical model of nearly-planar graphs and show that the non-planar graphs that fit this model do have polynomial expansion, i.e., they and all their subgraphs have small separators. We also analyze the Urban Road Network Data set and show that the model is indeed a good fit for non-planar road networks.Finally, we investigate the C-Planarity problem which asks for drawing of a clustered graph in which each cluster is represented by a simple closed region with no edge-edge crossings, no region-region crossings, and no unnecessary edge-region crossings. We study C-Planarity for embedded flat clustered graphs, embedded graphs whose clusters partition the vertex set. We provide a subexponential-time algorithm to test C-Planarity for these graphs when the face size is bounded. Further, we also study a variation of tree decomposition in which, for each face, including the outer face, there is a bag that contains every vertex of the face. We show that C-Planarity is fixed-parameter tractable with the embedded-width of the underlying graph and the number of disconnected clusters as parameters." @default.
• W2914448900 created "2019-02-21" @default.
• W2914448900 creator A5073959131 @default.
• W2914448900 date "2018-01-01" @default.
• W2914448900 modified "2023-09-23" @default.
• W2914448900 title "Topological Algorithms for Geographic and Geometric Graphs" @default.
• W2914448900 hasPublicationYear "2018" @default.
• W2914448900 type Work @default.
• W2914448900 sameAs 2914448900 @default.
• W2914448900 citedByCount "0" @default.
• W2914448900 crossrefType "journal-article" @default.
• W2914448900 hasAuthorship W2914448900A5073959131 @default.
• W2914448900 hasConcept C101837359 @default.
• W2914448900 hasConcept C11413529 @default.
• W2914448900 hasConcept C114614502 @default.
• W2914448900 hasConcept C132525143 @default.
• W2914448900 hasConcept C184720557 @default.
• W2914448900 hasConcept C311688 @default.
• W2914448900 hasConcept C33923547 @default.
• W2914448900 hasConcept C41008148 @default.
• W2914448900 hasConcept C53471067 @default.
• W2914448900 hasConcept C80444323 @default.
• W2914448900 hasConcept C80899671 @default.
• W2914448900 hasConceptScore W2914448900C101837359 @default.
• W2914448900 hasConceptScore W2914448900C11413529 @default.
• W2914448900 hasConceptScore W2914448900C114614502 @default.
• W2914448900 hasConceptScore W2914448900C132525143 @default.
• W2914448900 hasConceptScore W2914448900C184720557 @default.
• W2914448900 hasConceptScore W2914448900C311688 @default.
• W2914448900 hasConceptScore W2914448900C33923547 @default.
• W2914448900 hasConceptScore W2914448900C41008148 @default.
• W2914448900 hasConceptScore W2914448900C53471067 @default.
• W2914448900 hasConceptScore W2914448900C80444323 @default.
• W2914448900 hasConceptScore W2914448900C80899671 @default.
• W2914448900 hasLocation W29144489001 @default.
• W2914448900 hasOpenAccess W2914448900 @default.
• W2914448900 hasPrimaryLocation W29144489001 @default.
• W2914448900 hasRelatedWork W1529709047 @default.
• W2914448900 hasRelatedWork W1532852577 @default.
• W2914448900 hasRelatedWork W160524401 @default.
• W2914448900 hasRelatedWork W180042605 @default.
• W2914448900 hasRelatedWork W2008562682 @default.
• W2914448900 hasRelatedWork W2030308862 @default.
• W2914448900 hasRelatedWork W2032543589 @default.
• W2914448900 hasRelatedWork W2098823334 @default.
• W2914448900 hasRelatedWork W2109478355 @default.
• W2914448900 hasRelatedWork W2160337601 @default.
• W2914448900 hasRelatedWork W2164570237 @default.
• W2914448900 hasRelatedWork W2405933735 @default.
• W2914448900 hasRelatedWork W2586853540 @default.
• W2914448900 hasRelatedWork W2953015938 @default.
• W2914448900 hasRelatedWork W2963162524 @default.
• W2914448900 hasRelatedWork W2963573880 @default.
• W2914448900 hasRelatedWork W2964311205 @default.
• W2914448900 hasRelatedWork W3090990029 @default.
• W2914448900 hasRelatedWork W3162269515 @default.
• W2914448900 hasRelatedWork W83100440 @default.
• W2914448900 isParatext "false" @default.
• W2914448900 isRetracted "false" @default.
• W2914448900 magId "2914448900" @default.
• W2914448900 workType "article" @default.