3 citations · 7 across the 12 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.DM2013★ 1 cited
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II
Arman Boyacı, Tınaz Ekim, Mordechai Shalom +1
Given a tree and a set P of non-trivial simple paths on it, VPT(P) is the VPT graph (i.e. the vertex intersection graph) of the paths P, and EPT(P) is the EPT graph (i.e. the edge…
cs.DM2013★ 3 cited
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Towards Hole Representations-Part I
Arman Boyacı, Tınaz Ekim, Mordechai Shalom +1
Given a tree and a set of non-trivial simple paths on it, is the VPT graph (i.e. the vertex intersection graph) of the paths of the tree ,…
cs.NI2013
Online Regenerator Placement
George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong +1
Connections between nodes in optical networks are realized by lightpaths. Due to the decay of the signal, a regenerator has to be placed on every lightpath after at most hops,…