On Some Variants of the Bandwidth Minimization Problem

No abstract is available for this paper.

• Publication year

  1984

• Venue

  SIAM journal on computing (Print)

• Publication date

  1984-07-27

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1137/0213040
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• No references are available for this paper.

• Solving Cyclic Antibandwidth Problem by SAT

  2026influential citation
• Sequential Counter Encoding for Staircase At-Most-One Constraints

  2025cites this paper
• Best of Both Worlds: Solving the Cyclic Bandwidth Problem by Combining Pre-existing Knowledge and Constraint Programming Techniques

  2024cites this paper
• Minimum gradation in greyscales of graphs

  2023cites this paper
• Population-based iterated greedy algorithm for the S-labeling problem

  2023cites this paper
• Connecting Connectomes to Physiology

  2023cites this paper
• A general variable neighborhood search for the cyclic antibandwidth problem

  2022cites this paper
• A Just-in-Time Networking Framework for Minimizing Request-Response Latency of Wireless Time-Sensitive Applications

  2021influential citation
• Optimizing consolidation processes in hubs: The hub-arrival-departure problem

  2021cites this paper
• Search Trajectory Networks Applied to the Cyclic Bandwidth Sum Problem

  2021cites this paper
• A metric approach for scheduling problems with minimizing the maximum penalty

  2021cites this paper
• Improved Lower Bounds for the Cyclic Bandwidth Problem

  2021cites this paper
• Deep Two-way Matrix Reordering for Relational Data Analysis

  2021cites this paper
• AutoLL: Automatic Linear Layout of Graphs based on Deep Neural Network

  2021cites this paper
• A new iterated local search algorithm for the cyclic bandwidth problem

  2020cites this paper
• Duplex Encoding of Staircase At-Most-One Constraints for the Antibandwidth Problem

  2020cites this paper
• Artificial Evolution: 14th International Conference, Évolution Artificielle, EA 2019, Mulhouse, France, October 29–30, 2019, Revised Selected Papers

  2020cites this paper
• A Study of Recombination Operators for the Cyclic Bandwidth Problem

  2019cites this paper
• Lower bounds for the bandwidth problem

  2019cites this paper
• A Hybrid Ant Colony Optimization Approach for the Cyclic Antibandwidth Problem

  2019cites this paper
• An Iterated Three-Phase Search Approach for Solving the Cyclic Bandwidth Problem

  2019cites this paper
• A note on computational approaches for the antibandwidth problem

  2019influential citation
• Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes

  2018cites this paper
• Scheduling bi-colored chains

  2018cites this paper
• C O ] 1 1 Ja n 20 18 Gradation in Greyscales of Graphs

  2018cites this paper
• Visual Analytic Methods for Exploring Large Amounts of Relational Data with Matrix-based Representations

  2017cites this paper
• Some Research Topics

  2017cites this paper
• Contrast in greyscales of graphs

  2016cites this paper
• Matrix Reordering Methods for Table and Network Visualization

  2016cites this paper
• CuMAS: Data Transfer Aware Multi-Application Scheduling for Shared GPUs

  2016cites this paper
• Gradation in Greyscales of Graphs

  2016cites this paper
• Advanced Autonomous Search Algorithms for the Cyclic Bandwidth Problem

  2015cites this paper
• Safe labeling of graphs with minimum span

  2015cites this paper
• Advanced Autonomous Search Algorithms for the Cyclic Bandwidth Problem Subject Thesis Proposal Supervisors

  2015cites this paper
• Tabu search for the cyclic bandwidth problem

  2015cites this paper
• The maximum k-differential coloring problem

  2014influential citation
• Viewing Abstract Data as Maps

  2014cites this paper
• Antibandwidth problem for itchy caterpillars

  2014cites this paper
• Level‐based heuristics and hill climbing for the antibandwidth maximization problem

  2014cites this paper
• A Note on Maximum Dierential Coloring of

  2014cites this paper
• A note on maximum differential coloring of planar graphs

  2014cites this paper
• The Bandwidths of a Matrix. A Survey of Algorithms

  2014influential citation
• How To Color A Map

  2014cites this paper
• Increasing the Antibandwidth of Sparse Matrices by a Genetic Algorithm

  2013cites this paper
• A hybrid metaheuristic for the cyclic antibandwidth problem

  2013cites this paper
• Bit-Error Resilient Index Assignment for Multiple Description Scalar Quantizers

  2013influential citation
• Data as Maps

  2013cites this paper
• Maximum Differential Coloring of Caterpillars and Spiders

  2013cites this paper
• On Maximum Differential Coloring of Planar Graphs

  2013cites this paper
• A New Branch and Bound Algorithm for the Cyclic Bandwidth Problem

  2012influential citation
• Hybrid ant models with a transition policy for solving a complex problem

  2012cites this paper
• Variable neighborhood search with ejection chains for the antibandwidth problem

  2012cites this paper
• Antibandwidth of Bipartite Graphs

  2012cites this paper
• A special antidilation problem for meshes and Hamming graphs

  2012cites this paper
• Algoritmos para el Problema de Minimización del Ancho de Banda Cíclico en Grafos Generales

  2012cites this paper
• Antibandwidth of a Graph

  2012cites this paper
• An Improved Memetic Algorithm for the Antibandwidth Problem

  2011cites this paper
• Memetic algorithm for the antibandwidth maximization problem

  2011cites this paper
• A memetic algorithm for the cyclic antibandwidth maximization problem

  2011cites this paper
• GRASP with path relinking heuristics for the antibandwidth problem

  2011cites this paper
• A Hybrid ACO Approach to the Matrix Bandwidth Minimization Problem

  2010cites this paper
• On Maximum Differential Graph Coloring

  2010cites this paper
• Antibandwidth and cyclic antibandwidth of Hamming graphs

  2009cites this paper
• On explicit formulas for bandwidth and antibandwidth of hypercubes

  2009cites this paper
• Antibandwidth and cyclic antibandwidth of meshes and hypercubes

  2009influential citation
• Graph Structure and Monadic Second-Order Logic, chapters 7-10

  2009cites this paper
• Antibandwidth of d-Dimensional Meshes

  2009cites this paper
• Antibandwidth of complete k-ary trees

  2009influential citation
• Estimates of the absolute error and a scheme for an approximate solution to scheduling problems

  2009cites this paper
• Separation numbers of trees

  2009cites this paper
• Approche de réseaux de neurones récurrents pour le problème de l'ordonnancement cyclique et sa variante

  2008cites this paper
• Cyclic bandwidth with an edge added

  2008cites this paper
• Antibandwidth of Three-Dimensional Meshes

  2007cites this paper
• Çae Ëëàààíäáaeae Ää Ëàçèëë Ääëëáááááìáçae¸çåèäääáìì Aeae Èèêçáååìáçae

  2007cites this paper
• Research Summary and Research Plan for Garth Isaak

  2007cites this paper
• Separation in Graphs : A Survey and Some Recent Results

  2007cites this paper
• Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems

  2006cites this paper
• Antibandwidth of Complete k-Ary Trees

  2006influential citation
• The Cyclic Antibandwidth Problem

  2005cites this paper
• Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time

  2004cites this paper
• Algorithmic uses of the Feferman-Vaught Theorem

  2004cites this paper
• Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay

  2004cites this paper
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity

  2003cites this paper
• Kantenkreuzungen in Kreislayouts

  2003cites this paper
• Topics in Soft Computing

  2002cites this paper
• On scheduling cycle shops: classification, complexity and approximation

  2002cites this paper
• Minimizing the makespan for a UET bipartite graph on a single processor with an integer precedence delay

  2001cites this paper
• Scheduling time-constrained instructions on pipelined processors

  2001cites this paper
• Congestion and dilation, similarities and differences: A survey

  2000cites this paper
• Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems

  1998cites this paper
• Object Oriented Mathematical Modelling and Compilation to Parallel Code

  1997cites this paper
• Bandwidth, edgesum and profile of graphs

  1997cites this paper
• Scheduling Dyadic Intervals

  1995cites this paper
• On Embeddings in Cycles

  1995cites this paper
• Scheduling time-critical instructions on RISC machines

  1993cites this paper
• On Embedding Interconnection Networks into Rings of Processors

  1992cites this paper
• The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues

  1992cites this paper
• Syntactic Analysis of Context-Free Plex Languages for Pattern Recognition

  1992cites this paper
• End-to-end scheduling to meet deadlines in distributed systems

  1992cites this paper
• Scheduling Real-Time Computations with Separation Constraints

  1992cites this paper