83 citations · 248 across the 19 of their papers we have counts for
5 papers · 1 filter
Optimal algorithm for computing Steiner 3-eccentricities of trees
Aleksandar Ilic
The Steiner -eccentricity of a vertex of a graph is the maximum Steiner distance over all -subsets of which contain . In this note, we design a linear algo…
Path matrix and path energy of graphs
Aleksandar Ilic, Milan Basic
Given a graph , we associate a path matrix whose entry represents the maximum number of vertex disjoint paths between the vertices and , with zeros on the ma…
On the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
Aleksandar Ilic
We consider a special case of the ordinary NP-hard two-machine flow shop problem with the objective of determining simultaneously a minimal common due date and the minimal number o…
Efficient algorithm for the vertex connectivity of trapezoid graphs
Aleksandar Ilic
The intersection graph of a collection of trapezoids with corner points lying on two parallel lines is called a trapezoid graph. These graphs and their generalizations were applied…
On vertex covers and matching number of trapezoid graphs
Aleksandar Ilic, Andreja Ilic
The intersection graph of a collection of trapezoids with corner points lying on two parallel lines is called a trapezoid graph. Using binary indexed tree data structure, we improv…