Mar 3, 2017 · In this paper we solve the minimum linear arrangement problem for bijective connection graphs (for short BC graphs) which include hypercubes, ...
Mar 3, 2017 · In this paper we solve the minimum linear arrangement problem for bijective connection graphs (for short BC graphs) which include hypercubes, ...
In this paper, we solve the minimum linear arrangement problem for bijective connection graphs (for short BC graphs) which include hypercubes, Möbius cubes, ...
Feb 28, 2018 · In this paper, we solve the minimum linear arrangement problem for bijective con- nection graphs (for short BC graphs) which include hypercubes, ...
This paper solves the minimum linear arrangement problem for bijective connection graphs with a linear ordering of the vertices of a graph.
People also ask
What is the minimum linear arrangement?
What is the optimal linear arrangement of interval graphs?
In this paper we solve the minimum linear arrangement problem for bijective connection graphs (for short BC graphs) which include hypercubes, M\"{o}bius cubes, ...
A linear arrangement is a labeling or a numbering or a linear ordering of the vertices of a graph. in this paper, we solve the minimum linear arrangement ...
Xiaofang Jiang, Qinghui Liu, Natarajan Parthiban, R. Sundara Rajan: A note on minimum linear arrangement for BC graphs. CoRR abs/1703.01149 (2017).
Fingerprint. Dive into the research topics of 'A note on minimum linear arrangement for BC graphs'. Together they form a unique fingerprint.
A note on minimum linear arrangement for BC graphs · Xiaofang JiangQinghui LiuN. ParthibanR. S. Rajan. Mathematics. Discret. Math. Algorithms Appl. 2018. TLDR.