An optimal time algorithm for minimum linear arrangement of chord graphs
type: Item
instance of: scholarly article
title: An optimal time algorithm for minimum linear arrangement of chord graphs
zbMATH Open document ID: 1321.68392
author: Pariya Raoufi
author: Habib Rostami
author: Hessam Bagherinezhad
published in: Information Sciences
publication date: 2015-09-23T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6484647
zbMATH Keywords: minimum linear arrangement
zbMATH Keywords: graph layout
zbMATH Keywords: labeling
zbMATH Keywords: chord graph
MaRDI profile type: Publication
full work available at URL: j.ins.2013.02.037
OpenAlex ID: W2036361787
cites work: Optimal Linear Ordering
cites work: Single Machine Job Sequencing with Precedence Constraints
cites work: Finding minimum weight connected dominating set in stochastic graph based on learning automata
cites work: On embedding subclasses of height-balanced trees in hypercubes
cites work: Embedding a family of disjoint 3D meshes into a crossed cube
cites work: Q4393287
cites work: Q4198056
cites work: Optimal Assignments of Numbers to Vertices
cites work: Optimal numberings and isoperimetric problems on graphs
cites work: Q4458414
cites work: On minimum cuts and the linear arrangement problem
cites work: Cycle embedding of augmented cubes
cites work: A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
cites work: Generating lower bounds for the linear arrangement problem
cites work: Distributed estimation over complex networks
cites work: Optimal Numberings of an $N \times N$ Array
cites work: Q3893961
cites work: Exact solution of the 2-dimensional grid arrangement problem
cites work: Experiments on the minimum linear arrangement problem
cites work: Q4036610
cites work: Minimum linear arrangement of chord graphs
cites work: Graph minimum linear arrangement by multilevel weighted edge contractions
cites work: Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
cites work: Embedding meshes into twisted-cubes
cites work: Edge-bipancyclicity of star graphs under edge-fault tolerant
cites work: Conditional connectivity of star graph networks under embedding restriction
DOI: 10.1016/J.INS.2013.02.037
description: scientific article; zbMATH DE number 6484647