The following pages link to Krishnaiyan Thulasiraman (Q528471):
Displaying 50 items.
- Conditional diagnosability of a class of matching composition networks under the comparison model (Q528473) (← links)
- Identifying codes of cycles with odd orders (Q942141) (← links)
- (Q1606887) (redirect page) (← links)
- Global optimization properties of parallel cooperative search algorithms: A simulation study (Q1606888) (← links)
- Failure propagation modeling and analysis via system interfaces (Q1793694) (← links)
- Fault tolerance of hypercube like networks: spanning laceability under edge faults (Q2192380) (← links)
- Symmetric PMC model of diagnosis, \(b\)-matchings in graphs and fault identification in \(t\)-diagnosable systems (Q2235745) (← links)
- The constrained shortest path problem: algorithmic approaches and an algebraic study with generalization (Q2369383) (← links)
- Dominator sequences in bipartite graphs (Q2404078) (← links)
- On the partial path protection scheme for WDM optical networks and polynomial time computability of primary and secondary paths (Q2468838) (← links)
- (Q2850079) (← links)
- (Q3309631) (← links)
- (Q3323860) (← links)
- Complexity of computation of a spanning tree enumeration algorithm (Q3341895) (← links)
- The d-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm (Q3591342) (← links)
- (Q3615802) (← links)
- Structure of the reachability problem for (0,l)-capacitated marked graphs (Q3762343) (← links)
- Structure of the submarking-reachability problem and network programming (Q3793963) (← links)
- On maximal planarization of nonplanar graphs (Q3799645) (← links)
- Planar embedding: linear-time algorithms for vertex placement and edge orderings (Q3801097) (← links)
- Maximum-weight markings in marked graphs: Algorithms and interpretations based on the simplex method (Q3833891) (← links)
- (Q3934423) (← links)
- (Q4004084) (← links)
- (Q4053515) (← links)
- (Q4067000) (← links)
- (n+2)-node resistive n-port realizability of Y-matrices (Q4103453) (← links)
- (Q4105597) (← links)
- (Q4105598) (← links)
- Continuously equivalent realizations of 3rd-order paramount matrices (Q4158978) (← links)
- On the number of conductances required for realizingY andK matrices (Q4161247) (← links)
- (n +p)-node realizability of Y-matrices of (n + 1)-node resistancen-port networks (Q4173297) (← links)
- (Q4178928) (← links)
- (Q4525722) (← links)
- Computing the shortest network under a fixed topology (Q4571275) (← links)
- Constrained shortest link-disjoint paths selection: a network programming based approach (Q4590493) (← links)
- (Q4635955) (← links)
- (Q4635956) (← links)
- (Q4635957) (← links)
- (Q4635961) (← links)
- (Q4635962) (← links)
- (Q4635963) (← links)
- (Q4635966) (← links)
- (Q4635968) (← links)
- (Q4635971) (← links)
- (Q4635975) (← links)
- (Q4635983) (← links)
- (Q4635995) (← links)
- (Q4635996) (← links)
- MOD-CHAR: an implementation of Char's spanning tree enumeration algorithm and its complexity analysis (Q4733403) (← links)
- Hybrid PMC (HPMC) fault model and diagnosability of interconnection networks (Q5012378) (← links)
