10 citations · 12 across the 3 of their papers we have counts for
3 papers
Chordal Bipartite Graphs with High Boxicity
L. Sunil Chandran, Mathew C. Francis, Rogers Mathew
The boxicity of a graph G is defined as the minimum integer k such that G is an intersection graph of axis-parallel k-dimensional boxes. Chordal bipartite graphs are bipartite grap…
Boxicity of Leaf Powers
L. Sunil Chandran, Mathew C. Francis, Rogers Mathew
The boxicity of a graph G, denoted as box(G) is defined as the minimum integer t such that G is an intersection graph of axis-parallel t-dimensional boxes. A graph G is a k-leaf po…
Faster Algorithms for Online Topological Ordering
Telikepalli Kavitha, Rogers Mathew
We present two algorithms for maintaining the topological order of a directed acyclic graph with n vertices, under an online edge insertion sequence of m edges. Efficient algorithm…