The following pages link to R. Jayakumar (Q3341894):
Displayed 9 items.
- Complexity of computation of a spanning tree enumeration algorithm (Q3341895) (← links)
- On maximal planarization of nonplanar graphs (Q3799645) (← links)
- Planar embedding: linear-time algorithms for vertex placement and edge orderings (Q3801097) (← links)
- Restructuring for fault-tolerant systolic arrays (Q3817617) (← links)
- (Q3934423) (← links)
- (Q4557781) (← links)
- MOD-CHAR: an implementation of Char's spanning tree enumeration algorithm and its complexity analysis (Q4733403) (← links)
- A study of two approaches for reconfiguring fault-tolerant systolic arrays (Q5375478) (← links)
- O(n2) algorithms for graph planarization (Q6199475) (← links)