[HTML][HTML] Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes—Part I
Given a tree and a set P of non-trivial simple paths on it, VPT (P) is the VPT graph (ie the
vertex intersection graph) of the paths P of the tree T, and EPT (P) is the EPT graph (ie the …
vertex intersection graph) of the paths P of the tree T, and EPT (P) is the EPT graph (ie the …
Method and apparatus for providing a route recommendation
G Li, AL Chiu, C Dailey, RD Doverspike… - US Patent …, 2016 - Google Patents
(54) METHOD AND APPARATUS FOR(52) US Cl. PROVIDING AROUTE
RECOMMENDATION CPC........... H04L 45/12I (2013.01); H04J 14/020.1 (2013.01); H04J …
RECOMMENDATION CPC........... H04L 45/12I (2013.01); H04J 14/020.1 (2013.01); H04J …
[HTML][HTML] Graphs of edge-intersecting and non-splitting paths
Abstract The families of Edge Intersection Graphs of Paths in a tree (resp. in a grid) EPT
(resp. EPG) are well studied graph classes. Recently we introduced the class of graphs of …
(resp. EPG) are well studied graph classes. Recently we introduced the class of graphs of …
Results of Empirical Searches for k-Connected Minimum-Mean-Hop Network Topologies
J Kakande, SK Korotky - ECOC 2016; 42nd European …, 2016 - ieeexplore.ieee.org
Results of Empirical Searches for k-Connected Minimum-Mean-Hop Network Topologies Page 1
Results of Empirical Searches for k-Connected Minimum-Mean-Hop Network Topologies Joseph …
Results of Empirical Searches for k-Connected Minimum-Mean-Hop Network Topologies Joseph …