FRINK Linked Data Fragments server

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

• W177287042 abstract "Data in real-world graph drawing applications often change frequently but incrementally. Any drastic change in the graph layout could disrupt a user's mental map. Furthermore, real-world applications like enterprise process or e-commerce graphing, where data change rapidly in both content and quantity, demand a comprehensive responsiveness when rendering the graph layout in a multi-user environment in real time. Most standard static graph drawing algorithms apply global changes and redraw the entire graph layout whenever the data change. The new layout may be very different from the previous layout and the time taken to redraw the entire graph degrades quickly as the amount of graph data grows. Dynamic behavior and the quantity of data generated by real-world applications pose challenges for existing graph drawing algorithms in terms of incremental stability and scalability. A constrained hierarchical graph drawing framework and modified Sugiyama heuristic were developed in this research. The goal of this research was to improve the scalability of the constrained graph drawing framework while preserving layout stability. The framework's use of the relational data model shifts the graph application from the traditional desktop to a collaborative and distributed environment by reusing vertex and edge information stored in a relational database. This research was based on the work of North and Woodhull (2001) and the constrained crossing reduction problem proposed by Forster (2004). The result of the constrained hierarchical graph drawing framework and the new Sugiyama heuristic, especially the modified barycenter algorithms, were tested and evaluated against the Graphviz framework and North and Woodhull's (2001) online graph drawing framework. The performance test results showed that the constrained graph drawing framework run time is comparable with the performance of the Graphviz framework in terms of generating static graph layouts, which is independent of database accesses. Decoupling graph visualization from the graph editing modules improved scalability, enabling the rendering of large graphs in real time. The visualization test also showed that the constrained framework satisfied the aesthetic criteria for constrained graph layouts. Future enhancements for this proposed framework include implementation of (1) the horizontal coordinate assignment algorithm, (2) drawing polylines for multilayer edges in the rendering module, and (3) displaying subgraphs for very large graph layouts." @default.
• W177287042 created "2016-06-24" @default.
• W177287042 creator A5067267970 @default.
• W177287042 creator A5076376278 @default.
• W177287042 date "2011-01-01" @default.
• W177287042 modified "2023-09-26" @default.
• W177287042 title "A heuristic for the constrained one-sided two-layered crossing reduction problem for dynamic graph layout" @default.
• W177287042 cites W1502972208 @default.
• W177287042 cites W1533210402 @default.
• W177287042 cites W2015342663 @default.
• W177287042 cites W2060538865 @default.
• W177287042 cites W2074323223 @default.
• W177287042 cites W2077840726 @default.
• W177287042 cites W2102200067 @default.
• W177287042 cites W2102664288 @default.
• W177287042 cites W1546777795 @default.
• W177287042 hasPublicationYear "2011" @default.
• W177287042 type Work @default.
• W177287042 sameAs 177287042 @default.
• W177287042 citedByCount "0" @default.
• W177287042 crossrefType "journal-article" @default.
• W177287042 hasAuthorship W177287042A5067267970 @default.
• W177287042 hasAuthorship W177287042A5076376278 @default.
• W177287042 hasConcept C112953755 @default.
• W177287042 hasConcept C132525143 @default.
• W177287042 hasConcept C176225458 @default.
• W177287042 hasConcept C2911174283 @default.
• W177287042 hasConcept C41008148 @default.
• W177287042 hasConcept C48044578 @default.
• W177287042 hasConcept C77088390 @default.
• W177287042 hasConcept C80444323 @default.
• W177287042 hasConceptScore W177287042C112953755 @default.
• W177287042 hasConceptScore W177287042C132525143 @default.
• W177287042 hasConceptScore W177287042C176225458 @default.
• W177287042 hasConceptScore W177287042C2911174283 @default.
• W177287042 hasConceptScore W177287042C41008148 @default.
• W177287042 hasConceptScore W177287042C48044578 @default.
• W177287042 hasConceptScore W177287042C77088390 @default.
• W177287042 hasConceptScore W177287042C80444323 @default.
• W177287042 hasLocation W1772870421 @default.
• W177287042 hasOpenAccess W177287042 @default.
• W177287042 hasPrimaryLocation W1772870421 @default.
• W177287042 hasRelatedWork W134416760 @default.
• W177287042 hasRelatedWork W2056524360 @default.
• W177287042 hasRelatedWork W206270772 @default.
• W177287042 hasRelatedWork W2138478953 @default.
• W177287042 hasRelatedWork W2157813226 @default.
• W177287042 hasRelatedWork W2165770179 @default.
• W177287042 hasRelatedWork W217658273 @default.
• W177287042 hasRelatedWork W2205695184 @default.
• W177287042 hasRelatedWork W2520934545 @default.
• W177287042 hasRelatedWork W2734317791 @default.
• W177287042 hasRelatedWork W2741657924 @default.
• W177287042 hasRelatedWork W2743681419 @default.
• W177287042 hasRelatedWork W2777381214 @default.
• W177287042 hasRelatedWork W2972266895 @default.
• W177287042 hasRelatedWork W2976651171 @default.
• W177287042 hasRelatedWork W2981534755 @default.
• W177287042 hasRelatedWork W2985642308 @default.
• W177287042 hasRelatedWork W3013650881 @default.
• W177287042 hasRelatedWork W2607108329 @default.
• W177287042 hasRelatedWork W2815009464 @default.
• W177287042 isParatext "false" @default.
• W177287042 isRetracted "false" @default.
• W177287042 magId "177287042" @default.
• W177287042 workType "article" @default.