An optimal time algorithm for minimum linear arrangement of chord graphs-Reference-Cited by-同舟云学术

An optimal time algorithm for minimum linear arrangement of chord graphs

Published:2013-07 Issue: Volume:238 Page:212-220
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Raoufi Pariya,Rostami Habib,Bagherinezhad Hessam

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference36 articles.

1. Optimal linear ordering;Adolphson;SIAM J. Appl. Math.,1973

2. Single machine job sequencing with precedence constraints;Adolphson;SIAM J. Comput.,1977

3. Finding minimum weight connected dominating set in stochastic graph based on learning automata;Akbari Torkestani;Inf. Sci.,2012

4. On embedding subclasses of height-balanced trees in hypercubes;Choudum;Inf. Sci.,2009

5. F.R.K. Chung, Some problems and results in labelings of graphs, in: The Theory and Applications of Graphs, New York, 1980, pp. 255–264.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Arrow Matrix Decomposition: A Novel Approach for Communication-Efficient Sparse Matrix Multiplication;Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming;2024-02-20

2. Minimum Linear Arrangement of the Cartesian Product of Optimal Order Graph and Path;Parallel Processing Letters;2021-02-24

3. Lower and upper bounds for the linear arrangement problem on interval graphs;RAIRO - Operations Research;2018-10

4. A note on minimum linear arrangement for BC graphs;Discrete Mathematics, Algorithms and Applications;2018-04

5. On the OBDD representation of some graph classes;Discrete Applied Mathematics;2016-12