(a) Expand on L-edge . (b) Expand on L-edge . (c) Expand on E-edge (the number represents the length of the edge, triangles represent p-nodes, hollow circles represent d-nodes to be filled, and solid circles represent filled nodes).</p
<p>(a) i-links: z-edges (black), xy-edges (blue). (b) o-links: s-links(green), t-links(red). (c) who...
Two-dimensional contour map of the number of cluster perforations on both sides and the diameter of ...
<p>(a) linking a new node to an existing node; (b) linking two existing nodes; (c) linking two new n...
(a) Expand and based on edge . (b) The path after being expanded (triangles represent p-nodes, hol...
A p-node is inserted near the edge in CEL to form a new path (triangles represent p-nodes, and circl...
Elliptical region (hollow circles represent d-nodes to be filled, and triangles represent p-nodes).<...
<p>The only network topology, among <i>N</i><sub>1</sub>, <i>N</i><sub>2</sub> and <i>N</i><sub>3</s...
<p>KB size (in no. of edges) for different relation type under different expansion methods with <i>K...
A polygon Q rolls on a line m. The positions of a vertex when Q has a side flush with m form a polyg...
<p>(A) Consecutive nodes are merged. (B) Dead end (dotted circle) is removed. (C) Bubble (dotted cir...
<p>Illustration of how the radii from different nodes interact with each other and the pairwise dist...
Compared mean path length of various path planning algorithms for MR (The interval on each bar denot...
<p>Explanation of the clustering coefficient and path length using a schematic whole-brain binary ne...
<p>(a) The betweenness evolution image of each province. (b) The evolution image of the characterist...
Two-dimensional contour map of the number of intermediate cluster perforations and the number of clu...
<p>(a) i-links: z-edges (black), xy-edges (blue). (b) o-links: s-links(green), t-links(red). (c) who...
Two-dimensional contour map of the number of cluster perforations on both sides and the diameter of ...
<p>(a) linking a new node to an existing node; (b) linking two existing nodes; (c) linking two new n...
(a) Expand and based on edge . (b) The path after being expanded (triangles represent p-nodes, hol...
A p-node is inserted near the edge in CEL to form a new path (triangles represent p-nodes, and circl...
Elliptical region (hollow circles represent d-nodes to be filled, and triangles represent p-nodes).<...
<p>The only network topology, among <i>N</i><sub>1</sub>, <i>N</i><sub>2</sub> and <i>N</i><sub>3</s...
<p>KB size (in no. of edges) for different relation type under different expansion methods with <i>K...
A polygon Q rolls on a line m. The positions of a vertex when Q has a side flush with m form a polyg...
<p>(A) Consecutive nodes are merged. (B) Dead end (dotted circle) is removed. (C) Bubble (dotted cir...
<p>Illustration of how the radii from different nodes interact with each other and the pairwise dist...
Compared mean path length of various path planning algorithms for MR (The interval on each bar denot...
<p>Explanation of the clustering coefficient and path length using a schematic whole-brain binary ne...
<p>(a) The betweenness evolution image of each province. (b) The evolution image of the characterist...
Two-dimensional contour map of the number of intermediate cluster perforations and the number of clu...
<p>(a) i-links: z-edges (black), xy-edges (blue). (b) o-links: s-links(green), t-links(red). (c) who...
Two-dimensional contour map of the number of cluster perforations on both sides and the diameter of ...
<p>(a) linking a new node to an existing node; (b) linking two existing nodes; (c) linking two new n...
DOI
Add to ORKG