A Linear Time Algorithm for Constructing Proper-Path-Decomposition of Width Two
Summary :
The problem of constructing the proper-path-decomposition of width at most 2 has an application to the efficient graph layout into ladders. In this paper, we give a linear time algorithm which, for a given graph with maximum vertex degree at most 3, determines whether the proper-pathwidth of the graph is at most 2, and if so, constructs a proper-path-decomposition of width at most 2.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E81-A No.5 pp.729-737
- Publication Date
- 1998/05/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Akira MATSUBAYASHI, Shuichi UENO, "A Linear Time Algorithm for Constructing Proper-Path-Decomposition of Width Two" in IEICE TRANSACTIONS on Fundamentals,
vol. E81-A, no. 5, pp. 729-737, May 1998, doi: .
Abstract: The problem of constructing the proper-path-decomposition of width at most 2 has an application to the efficient graph layout into ladders. In this paper, we give a linear time algorithm which, for a given graph with maximum vertex degree at most 3, determines whether the proper-pathwidth of the graph is at most 2, and if so, constructs a proper-path-decomposition of width at most 2.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e81-a_5_729/_p
Copy
@ARTICLE{e81-a_5_729,
author={Akira MATSUBAYASHI, Shuichi UENO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Linear Time Algorithm for Constructing Proper-Path-Decomposition of Width Two},
year={1998},
volume={E81-A},
number={5},
pages={729-737},
abstract={The problem of constructing the proper-path-decomposition of width at most 2 has an application to the efficient graph layout into ladders. In this paper, we give a linear time algorithm which, for a given graph with maximum vertex degree at most 3, determines whether the proper-pathwidth of the graph is at most 2, and if so, constructs a proper-path-decomposition of width at most 2.},
keywords={},
doi={},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - A Linear Time Algorithm for Constructing Proper-Path-Decomposition of Width Two
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 729
EP - 737
AU - Akira MATSUBAYASHI
AU - Shuichi UENO
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E81-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 1998
AB - The problem of constructing the proper-path-decomposition of width at most 2 has an application to the efficient graph layout into ladders. In this paper, we give a linear time algorithm which, for a given graph with maximum vertex degree at most 3, determines whether the proper-pathwidth of the graph is at most 2, and if so, constructs a proper-path-decomposition of width at most 2.
ER -
English
