FRINK Linked Data Fragments server

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

• W2903669007 endingPage "1968" @default.
• W2903669007 startingPage "1948" @default.
• W2903669007 abstract "We present a graph-based method to identify primary flow and transport sub-networks in three-dimensional discrete fracture networks (DFNs). The structure of a DFN lends itself to the use of graphs as a coarse-scale representation that retains the multiscale nature of flow and transport through fracture media. We develop a bipartite graph representation that integrates fracture network topology, fracture geometry, and hydraulic properties. We show that the two most common graph-representations of DFNs, vertices representing intersections and vertices representing fractures, are projections of this bipartite graph thereby providing a generalization of previous DFN-graph frameworks. The primary subnetworks in each DFN are identified by running a heuristic algorithm that determines the edge-disjoint shortest paths through the graph which correspond to the regions where the fastest transport occurs. The method does not have any user-defined parameters and terminates in a finite number of steps. The quality of the method is demonstrated by comparing transport simulations on the identified primary subnetwork and full network, which are in good agreement for early and middle times. These estimates of the first passage times can be achieved with close to an order of magnitude reduction of computational expense using the proposed method." @default.
• W2903669007 created "2018-12-22" @default.
• W2903669007 creator A5002373487 @default.
• W2903669007 creator A5019329403 @default.
• W2903669007 creator A5039283075 @default.
• W2903669007 creator A5040570899 @default.
• W2903669007 creator A5073783714 @default.
• W2903669007 creator A5078718261 @default.
• W2903669007 date "2018-01-01" @default.
• W2903669007 modified "2023-10-15" @default.
• W2903669007 title "Identifying Backbones in Three-Dimensional Discrete Fracture Networks: A Bipartite Graph-Based Approach" @default.
• W2903669007 cites W1260906500 @default.
• W2903669007 cites W1585329782 @default.
• W2903669007 cites W1588612310 @default.
• W2903669007 cites W1591988668 @default.
• W2903669007 cites W1620059389 @default.
• W2903669007 cites W1640357299 @default.
• W2903669007 cites W1665316539 @default.
• W2903669007 cites W1673588499 @default.
• W2903669007 cites W1910869366 @default.
• W2903669007 cites W1934653627 @default.
• W2903669007 cites W1965316395 @default.
• W2903669007 cites W1966037514 @default.
• W2903669007 cites W1978305759 @default.
• W2903669007 cites W1979208158 @default.
• W2903669007 cites W1980381105 @default.
• W2903669007 cites W1992295222 @default.
• W2903669007 cites W2000693626 @default.
• W2903669007 cites W2017307986 @default.
• W2903669007 cites W2017911913 @default.
• W2903669007 cites W2022229842 @default.
• W2903669007 cites W2026883812 @default.
• W2903669007 cites W2033894077 @default.
• W2903669007 cites W2035012834 @default.
• W2903669007 cites W2044285635 @default.
• W2903669007 cites W2045131532 @default.
• W2903669007 cites W2048370221 @default.
• W2903669007 cites W2049754061 @default.
• W2903669007 cites W2049827342 @default.
• W2903669007 cites W2051875053 @default.
• W2903669007 cites W2056957643 @default.
• W2903669007 cites W2058735216 @default.
• W2903669007 cites W2062536417 @default.
• W2903669007 cites W2063538635 @default.
• W2903669007 cites W2065285415 @default.
• W2903669007 cites W2066420657 @default.
• W2903669007 cites W2071140455 @default.
• W2903669007 cites W2071434453 @default.
• W2903669007 cites W2079173970 @default.
• W2903669007 cites W2084284815 @default.
• W2903669007 cites W2086326746 @default.
• W2903669007 cites W2125393823 @default.
• W2903669007 cites W2133229181 @default.
• W2903669007 cites W2148606255 @default.
• W2903669007 cites W2154434560 @default.
• W2903669007 cites W2155061423 @default.
• W2903669007 cites W2186635838 @default.
• W2903669007 cites W2205745736 @default.
• W2903669007 cites W2213677646 @default.
• W2903669007 cites W2404390473 @default.
• W2903669007 cites W2411309851 @default.
• W2903669007 cites W2423922494 @default.
• W2903669007 cites W2463664594 @default.
• W2903669007 cites W2474629035 @default.
• W2903669007 cites W2487694981 @default.
• W2903669007 cites W2492739640 @default.
• W2903669007 cites W2507757066 @default.
• W2903669007 cites W2514742039 @default.
• W2903669007 cites W2531803770 @default.
• W2903669007 cites W2625711828 @default.
• W2903669007 cites W2735660938 @default.
• W2903669007 cites W2751364937 @default.
• W2903669007 cites W2759507687 @default.
• W2903669007 cites W2766844561 @default.
• W2903669007 cites W2799643946 @default.
• W2903669007 cites W2800542668 @default.
• W2903669007 cites W3014166345 @default.
• W2903669007 cites W3103992808 @default.
• W2903669007 cites W976211528 @default.
• W2903669007 doi "https://doi.org/10.1137/18m1180207" @default.
• W2903669007 hasPublicationYear "2018" @default.
• W2903669007 type Work @default.
• W2903669007 sameAs 2903669007 @default.
• W2903669007 citedByCount "30" @default.
• W2903669007 countsByYear W29036690072018 @default.
• W2903669007 countsByYear W29036690072019 @default.
• W2903669007 countsByYear W29036690072020 @default.
• W2903669007 countsByYear W29036690072021 @default.
• W2903669007 countsByYear W29036690072022 @default.
• W2903669007 countsByYear W29036690072023 @default.
• W2903669007 crossrefType "journal-article" @default.
• W2903669007 hasAuthorship W2903669007A5002373487 @default.
• W2903669007 hasAuthorship W2903669007A5019329403 @default.
• W2903669007 hasAuthorship W2903669007A5039283075 @default.
• W2903669007 hasAuthorship W2903669007A5040570899 @default.
• W2903669007 hasAuthorship W2903669007A5073783714 @default.
• W2903669007 hasAuthorship W2903669007A5078718261 @default.
• W2903669007 hasBestOaLocation W29036690072 @default.

• next