scholarly journals Simplicial Vertices in Graphs with no Induced Four-Edge Path or Four-Edge Antipath, and theH6-Conjecture

2013 ◽  
Vol 76 (4) ◽  
pp. 249-261 ◽  
Author(s):  
Maria Chudnovsky ◽  
Peter Maceli
Keyword(s):  
Edge Path

scholarly journals A superclass of Edge-Path-Tree graphs with few cliques

2009 ◽  
Vol 37 (5) ◽  
pp. 351-355 ◽  
Author(s):  
Nicola Apollonio ◽  
Massimiliano Caramia
Keyword(s):  
Tree Graphs ◽  
Edge Path

L( $$d$$ d ,1)-labelings of the edge-path-replacement by factorization of graphs

2013 ◽  
Vol 30 (1) ◽  
pp. 34-41 ◽  
Author(s):  
Nathaniel Karst ◽  
Jessica Oehrlein ◽  
Denise Sakai Troxell ◽  
Junjie Zhu
Keyword(s):  
Edge Path

scholarly journals The Study Trees Potential for Forest in Universitas Lancang Kuning Pekanbaru

2019 ◽  
Vol 20 (1) ◽  
pp. 77-85
Author(s):  
Marta Dinata ◽  
Fitridawati Fitridawati ◽  
Lusi Dwi Putri
Keyword(s):  
Tree Species ◽  
Three Dimensions ◽  
Acacia Auriculiformis ◽  
Soil Conditions ◽  
Fragmented Habitat ◽  
Litter Accumulation ◽  
A Value ◽  
Integrated Research ◽  
Structure Observation ◽  
Edge Path

The location of the study of Potential tree species for Peripheral Forest Development is determined by Lancang Kuning University, which is on Yos Sudarso road KM 8 Rumbai Pekanbaru, which is a fragmented habitat. The method used is census through measurement of area, structure observation, population enumeration, measurement of three dimensions. Calculating tree species diversity (H '), Assessing the suitability criteria of a type of tree for each type of green edge path area refers to the method of analyzing an integrated research plan, the important value index for the highest vegetation is acacia (Acacia auriculiformis) with a value amounting to 73.11. Acacia (Acacia auriculiformis) type of tree is less suitable. This is because the population is too high, where the debris that falls hard to decompose causes a thick pile when trampled slipperily and endangers safety, which eventually leaves litter accumulation causing soil conditions on the slopes to become soft because it is moist and has the potential to become landslides.

On edge-path eigenvalues of graphs

2020 ◽  
pp. 1-11
Author(s):  
Saieed Akbari ◽  
Seyran Azizi ◽  
Modjtaba Ghorbani ◽  
Xueliang Li
Keyword(s):  
Edge Path ◽  
Eigenvalues Of Graphs

An Algorithm for the Generation of an Optimum CMM Inspection Path

1994 ◽  
Vol 116 (3) ◽  
pp. 396-404 ◽  
Author(s):  
E. Lu ◽  
J. Ni ◽  
S. M. Wu
Keyword(s):  
Selection Criterion ◽  
Inspection Time ◽  
Sequential Decision Making ◽  
Selection Strategy ◽  
Sequential Decision ◽  
Edge Point ◽  
Actual Measurement ◽  
Test Part ◽  
Work Spaces ◽  
Edge Path

An algorithm for generating an optimum CMM inspection path is developed to improve the throughput of CMMs. In this algorithm, a modified 3-D ray tracing technique is applied to an octree database of a CMM configuration space to detect obstacles between any two target points. After an obstacle is detected, collision-free silhouette contour vertices of the object are generated, from a selection criterion, as potential points of a vertex path. As the ray advances, a sequential-decision-making technique is used to derive the suboptimum vertex path from possible collision-free vertex paths. After the suboptimum vertex path is generated, a selection strategy is employed to ensure a correct edge path sequence for deriving an optimum edge point path. A 3-D simulation shows that the proposed global algorithm eliminates the dynamically undesirable characteristics of octree based algorithms and saves searching time in congested work spaces by finding paths around colliding objects. Actual measurement of a test part indicates that the proposed method can reduce the inspection time to less than half as compared to the interactive graphic method.

scholarly journals Comparison Analysis of Multipath Routing Implementation in Software Defined Network

2021 ◽  
Author(s):  
Syaifuddin Syaifuddin ◽  
Muhamad Fathul Azis ◽  
Fauzi Dwi Setiawan Sumadi
Keyword(s):  
Data Transmission ◽  
Traffic Congestion ◽  
Routing Algorithm ◽  
Multipath Routing ◽  
Software Defined Network ◽  
Transmission Process ◽  
Modified Method ◽  
Edge Path ◽  
Path Search ◽  
Manual Calculation

Multipath routing is a path search method used as a data transmission process utilizing more than one available path on a network. The multipath routing concept is directed to substitute the single path routing concept for reducing network traffic congestion by distributing data transmission through several available paths. It can be implemented in the Software Defined Network (SDN) environment that separates the control plane and the data plane, which provides flexibility by deploying application-based solutions to resolve the problem. This paper is directed to implement the modified Deep First Search (DFS) multipath routing algorithm and compare the proposed method with Dijkstra and normal DFS multipath algorithm. The contribution was designed by combining the node, edge, path, and bucket weight using port statistics available in OpenFlow standard and manual calculation. The results of the system’s emulation showed that the overall algorithm could determine more than one path for the data transmission process. The average execution time on all algorithms produced 0.0903 ms for the modified DFS multipath algorithm, 0.0858 ms for DFS multipath algorithm, and 0.901 ms Dijkstra multipath algorithm, respectively. The QoS parameter testing results illustrated that the proposed method was better than another multipath routing algorithm in terms of throughput and jitter. However, based on packet loss percentage, the modified method was placed after normal DFS but still generated better results than Dijkstra. Overall, the implement multipath routing concept in SDN with all algorithms could be deployed to provide more than one data transmission path.

scholarly journals Recognizing Helly Edge-Path-Tree graphs and their clique graphs

2011 ◽  
Vol 159 (11) ◽  
pp. 1166-1175 ◽  
Author(s):  
Nicola Apollonio ◽  
Massimiliano Caramia
Keyword(s):  
Tree Graphs ◽  
Edge Path ◽  
Clique Graphs

scholarly journals A Dual-Path and Lightweight Convolutional Neural Network for High-Resolution Aerial Image Segmentation

2019 ◽  
Vol 8 (12) ◽  
pp. 582 ◽  
Author(s):  
Gang Zhang ◽  
Tao Lei ◽  
Yi Cui ◽  
Ping Jiang
Keyword(s):  
Neural Network ◽  
Image Segmentation ◽  
High Resolution ◽  
Convolutional Neural Network ◽  
Feature Learning ◽  
Semantic Segmentation ◽  
Aerial Images ◽  
Aerial Image ◽  
Sensing Applications ◽  
Edge Path

Semantic segmentation on high-resolution aerial images plays a significant role in many remote sensing applications. Although the Deep Convolutional Neural Network (DCNN) has shown great performance in this task, it still faces the following two challenges: intra-class heterogeneity and inter-class homogeneity. To overcome these two problems, a novel dual-path DCNN, which contains a spatial path and an edge path, is proposed for high-resolution aerial image segmentation. The spatial path, which combines the multi-level and global context features to encode the local and global information, is used to address the intra-class heterogeneity challenge. For inter-class homogeneity problem, a Holistically-nested Edge Detection (HED)-like edge path is employed to detect the semantic boundaries for the guidance of feature learning. Furthermore, we improve the computational efficiency of the network by employing the backbone of MobileNetV2. We enhance the performance of MobileNetV2 with two modifications: (1) replacing the standard convolution in the last four Bottleneck Residual Blocks (BRBs) with atrous convolution; and (2) removing the convolution stride of 2 in the first layer of BRBs 4 and 6. Experimental results on the ISPRS Vaihingen and Potsdam 2D labeling dataset show that the proposed DCNN achieved real-time inference speed on a single GPU card with better performance, compared with the state-of-the-art baselines.

Sign in / Sign up

Export Citation Format

Share Document