On excessive index of certain networks

DOI10.1016/j.tcs.2013.05.016zbMath1301.05321OpenAlexW2085666028MaRDI QIDQ391312

A. S. Shanthi, Indra Rajasingh, Albert Muthumalai, Rajan Bharati

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.05.016

zbMATH Keywords

butterfly networkperfect matchingBenes networkhoneycomb networkexcessive index

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

Excessive index for mesh derived networks ⋮ On the Complexity of Computing the Excessive [B-Index of a Graph] ⋮ General transmission lemma and Wiener complexity of triangular grids ⋮ Excessive \([l, m\)-factorizations]

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
• Graphs of arbitrary excessive class
• 1-factor covers of regular graphs
• An efficient representation of Benes networks and its applications
• Scheduling for parallel processing
• A note on Berge-Fulkerson coloring
• Scheduling multiprocessor tasks -- An overview
• The excessive [3-index of all graphs]
• Minimum spanners of butterfly graphs
• On Fulkerson conjecture
• The equivalence of two conjectures of Berge and Fulkerson
• On minimum sets of 1-factors covering a complete multipartite graph
• The NP-Completeness of Edge-Coloring
• Parallel contractions of grids for task assignment to processor networks
• Blocking and anti-blocking pairs of polyhedra

This page was built for publication: On excessive index of certain networks