Eintrag weiter verarbeiten
A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set VNT on Series-Parallel Graphs
Gespeichert in:
Zeitschriftentitel: | IEICE Transactions on Information and Systems |
---|---|
Personen und Körperschaften: | , |
In: | IEICE Transactions on Information and Systems, E102.D, 2019, 4, S. 826-835 |
Medientyp: | E-Article |
Sprache: | Englisch |
veröffentlicht: |
Institute of Electronics, Information and Communications Engineers (IEICE)
|
Schlagwörter: |
author_facet |
NAKAYAMA, Shin-ichi MASUYAMA, Shigeru NAKAYAMA, Shin-ichi MASUYAMA, Shigeru |
---|---|
author |
NAKAYAMA, Shin-ichi MASUYAMA, Shigeru |
spellingShingle |
NAKAYAMA, Shin-ichi MASUYAMA, Shigeru IEICE Transactions on Information and Systems A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set VNT on Series-Parallel Graphs Artificial Intelligence Electrical and Electronic Engineering Computer Vision and Pattern Recognition Hardware and Architecture Software |
author_sort |
nakayama, shin-ichi |
spelling |
NAKAYAMA, Shin-ichi MASUYAMA, Shigeru 0916-8532 1745-1361 Institute of Electronics, Information and Communications Engineers (IEICE) Artificial Intelligence Electrical and Electronic Engineering Computer Vision and Pattern Recognition Hardware and Architecture Software http://dx.doi.org/10.1587/transinf.2018edp7232 A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set <i>V<sub>NT</sub></i> on Series-Parallel Graphs IEICE Transactions on Information and Systems |
doi_str_mv |
10.1587/transinf.2018edp7232 |
facet_avail |
Online Free |
finc_class_facet |
Informatik Technik Mathematik Physik |
format |
ElectronicArticle |
fullrecord |
blob:ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTU4Ny90cmFuc2luZi4yMDE4ZWRwNzIzMg |
id |
ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTU4Ny90cmFuc2luZi4yMDE4ZWRwNzIzMg |
institution |
DE-D275 DE-Bn3 DE-Brt1 DE-Zwi2 DE-D161 DE-Gla1 DE-Zi4 DE-15 DE-Rs1 DE-Pl11 DE-105 DE-14 DE-Ch1 DE-L229 |
imprint |
Institute of Electronics, Information and Communications Engineers (IEICE), 2019 |
imprint_str_mv |
Institute of Electronics, Information and Communications Engineers (IEICE), 2019 |
issn |
0916-8532 1745-1361 |
issn_str_mv |
0916-8532 1745-1361 |
language |
English |
mega_collection |
Institute of Electronics, Information and Communications Engineers (IEICE) (CrossRef) |
match_str |
nakayama2019alineartimealgorithmforfindingaminimumspanningtreewithnonterminalsetvntonseriesparallelgraphs |
publishDateSort |
2019 |
publisher |
Institute of Electronics, Information and Communications Engineers (IEICE) |
recordtype |
ai |
record_format |
ai |
series |
IEICE Transactions on Information and Systems |
source_id |
49 |
title |
A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set VNT on Series-Parallel Graphs |
title_unstemmed |
A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set VNT on Series-Parallel Graphs |
title_full |
A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set VNT on Series-Parallel Graphs |
title_fullStr |
A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set VNT on Series-Parallel Graphs |
title_full_unstemmed |
A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set VNT on Series-Parallel Graphs |
title_short |
A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set VNT on Series-Parallel Graphs |
title_sort |
a linear time algorithm for finding a minimum spanning tree with non-terminal set <i>v<sub>nt</sub></i> on series-parallel graphs |
topic |
Artificial Intelligence Electrical and Electronic Engineering Computer Vision and Pattern Recognition Hardware and Architecture Software |
url |
http://dx.doi.org/10.1587/transinf.2018edp7232 |
publishDate |
2019 |
physical |
826-835 |
description |
|
container_issue |
4 |
container_start_page |
826 |
container_title |
IEICE Transactions on Information and Systems |
container_volume |
E102.D |
format_de105 |
Article, E-Article |
format_de14 |
Article, E-Article |
format_de15 |
Article, E-Article |
format_de520 |
Article, E-Article |
format_de540 |
Article, E-Article |
format_dech1 |
Article, E-Article |
format_ded117 |
Article, E-Article |
format_degla1 |
E-Article |
format_del152 |
Buch |
format_del189 |
Article, E-Article |
format_dezi4 |
Article |
format_dezwi2 |
Article, E-Article |
format_finc |
Article, E-Article |
format_nrw |
Article, E-Article |
_version_ |
1792328677788221459 |
geogr_code |
not assigned |
last_indexed |
2024-03-01T12:56:40.218Z |
geogr_code_person |
not assigned |
openURL |
url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=A+Linear+Time+Algorithm+for+Finding+a+Minimum+Spanning+Tree+with+Non-Terminal+Set+VNT+on+Series-Parallel+Graphs&rft.date=2019-04-01&genre=article&issn=1745-1361&volume=E102.D&issue=4&spage=826&epage=835&pages=826-835&jtitle=IEICE+Transactions+on+Information+and+Systems&atitle=A+Linear+Time+Algorithm+for+Finding+a+Minimum+Spanning+Tree+with+Non-Terminal+Set+%3Ci%3EV%3Csub%3ENT%3C%2Fsub%3E%3C%2Fi%3E+on+Series-Parallel+Graphs&aulast=MASUYAMA&aufirst=Shigeru&rft_id=info%3Adoi%2F10.1587%2Ftransinf.2018edp7232&rft.language%5B0%5D=eng |
SOLR | |
_version_ | 1792328677788221459 |
author | NAKAYAMA, Shin-ichi, MASUYAMA, Shigeru |
author_facet | NAKAYAMA, Shin-ichi, MASUYAMA, Shigeru, NAKAYAMA, Shin-ichi, MASUYAMA, Shigeru |
author_sort | nakayama, shin-ichi |
container_issue | 4 |
container_start_page | 826 |
container_title | IEICE Transactions on Information and Systems |
container_volume | E102.D |
description | |
doi_str_mv | 10.1587/transinf.2018edp7232 |
facet_avail | Online, Free |
finc_class_facet | Informatik, Technik, Mathematik, Physik |
format | ElectronicArticle |
format_de105 | Article, E-Article |
format_de14 | Article, E-Article |
format_de15 | Article, E-Article |
format_de520 | Article, E-Article |
format_de540 | Article, E-Article |
format_dech1 | Article, E-Article |
format_ded117 | Article, E-Article |
format_degla1 | E-Article |
format_del152 | Buch |
format_del189 | Article, E-Article |
format_dezi4 | Article |
format_dezwi2 | Article, E-Article |
format_finc | Article, E-Article |
format_nrw | Article, E-Article |
geogr_code | not assigned |
geogr_code_person | not assigned |
id | ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTU4Ny90cmFuc2luZi4yMDE4ZWRwNzIzMg |
imprint | Institute of Electronics, Information and Communications Engineers (IEICE), 2019 |
imprint_str_mv | Institute of Electronics, Information and Communications Engineers (IEICE), 2019 |
institution | DE-D275, DE-Bn3, DE-Brt1, DE-Zwi2, DE-D161, DE-Gla1, DE-Zi4, DE-15, DE-Rs1, DE-Pl11, DE-105, DE-14, DE-Ch1, DE-L229 |
issn | 0916-8532, 1745-1361 |
issn_str_mv | 0916-8532, 1745-1361 |
language | English |
last_indexed | 2024-03-01T12:56:40.218Z |
match_str | nakayama2019alineartimealgorithmforfindingaminimumspanningtreewithnonterminalsetvntonseriesparallelgraphs |
mega_collection | Institute of Electronics, Information and Communications Engineers (IEICE) (CrossRef) |
physical | 826-835 |
publishDate | 2019 |
publishDateSort | 2019 |
publisher | Institute of Electronics, Information and Communications Engineers (IEICE) |
record_format | ai |
recordtype | ai |
series | IEICE Transactions on Information and Systems |
source_id | 49 |
spelling | NAKAYAMA, Shin-ichi MASUYAMA, Shigeru 0916-8532 1745-1361 Institute of Electronics, Information and Communications Engineers (IEICE) Artificial Intelligence Electrical and Electronic Engineering Computer Vision and Pattern Recognition Hardware and Architecture Software http://dx.doi.org/10.1587/transinf.2018edp7232 A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set <i>V<sub>NT</sub></i> on Series-Parallel Graphs IEICE Transactions on Information and Systems |
spellingShingle | NAKAYAMA, Shin-ichi, MASUYAMA, Shigeru, IEICE Transactions on Information and Systems, A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set VNT on Series-Parallel Graphs, Artificial Intelligence, Electrical and Electronic Engineering, Computer Vision and Pattern Recognition, Hardware and Architecture, Software |
title | A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set VNT on Series-Parallel Graphs |
title_full | A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set VNT on Series-Parallel Graphs |
title_fullStr | A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set VNT on Series-Parallel Graphs |
title_full_unstemmed | A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set VNT on Series-Parallel Graphs |
title_short | A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set VNT on Series-Parallel Graphs |
title_sort | a linear time algorithm for finding a minimum spanning tree with non-terminal set <i>v<sub>nt</sub></i> on series-parallel graphs |
title_unstemmed | A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set VNT on Series-Parallel Graphs |
topic | Artificial Intelligence, Electrical and Electronic Engineering, Computer Vision and Pattern Recognition, Hardware and Architecture, Software |
url | http://dx.doi.org/10.1587/transinf.2018edp7232 |