Open Access
An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related Problems
-
Full Text Views
131
- Cite this
- Free PDF (704.5KB)
Summary :
- Publication
- IEICE TRANSACTIONS on Information Vol.0 No.0 pp.0-0
- Publicized
- 2024/08/01
- DOI
- 10.1587/10.1587/transinf.2024FCP0009
- Type of Manuscript
- PAPER
Authors
Latest Issue
Contents
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
Hitoshi MURAKAMI, Yutaro YAMAGUCHI, "An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related Problems" in IEICE TRANSACTIONS on Information,
vol. , no. 0, pp. 0-0, January , doi: 10.1587/10.1587/transinf.2024FCP0009.
Abstract:
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2024FCP0009/_advpub_f
Copy
@ARTICLE{2024FCP0009,
author={Hitoshi MURAKAMI, Yutaro YAMAGUCHI, },
journal={IEICE TRANSACTIONS on Information},
title={An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related Problems},
year={},
volume={},
number={0},
pages={0-0},
abstract={},
keywords={},
doi={10.1587/10.1587/transinf.2024FCP0009},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related Problems
T2 - IEICE TRANSACTIONS on Information
SP - 0
EP - 0
AU - Hitoshi MURAKAMI
AU - Yutaro YAMAGUCHI
PY -
DO - 10.1587/10.1587/transinf.2024FCP0009
JO - IEICE TRANSACTIONS on Information
SN -
VL -
IS - 0
JA - IEICE TRANSACTIONS on Information
Y1 - January
AB -
ER -
English
