Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013)

<Previous Article In Volume
Next Article In Volume>

A Linear Time Algorithm for Cubic Subgraph of Halin Graphs

Authors
Dingjun Lou, Junfu Liu
Corresponding Author
Dingjun Lou
Available Online March 2013.
DOI
10.2991/iccsee.2013.99How to use a DOI?
Keywords
Linear time algorithm, cubic subgraph, Halin graph
Abstract

In this paper, we design a linear time algorithm to determine whether a Halin graph H has a cubic subgraph H*. If H has, then the algorithm finds a cubic subgraph H* in H; otherwise the algorithm answers “No”

Copyright
© 2013, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

<Previous Article In Volume
Next Article In Volume>
Volume Title
Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013)
Series
Advances in Intelligent Systems Research
Publication Date
March 2013
ISBN
978-90-78677-61-1
ISSN
1951-6851
DOI
10.2991/iccsee.2013.99How to use a DOI?
Copyright
© 2013, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Cite this article

risenwbib
TY  - CONF
AU  - Dingjun Lou
AU  - Junfu Liu
PY  - 2013/03
DA  - 2013/03
TI  - A Linear Time Algorithm for Cubic Subgraph of Halin Graphs
BT  - Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013)
PB  - Atlantis Press
SP  - 386
EP  - 388
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccsee.2013.99
DO  - 10.2991/iccsee.2013.99
ID  - Lou2013/03
ER  -