Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

Capturing Polynomial Time using Modular Decomposition

Saved in:
Bibliographic Details
Published in:Logical Methods in Computer Science
Format: Online Article RSS Article
Published: 2019
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1864030187418550272
collection WordPress RSS
FRELIP Feed Integration
container_title Logical Methods in Computer Science
description
discipline_display Engineering & Technology
discipline_facet Engineering & Technology
format Online Article
RSS Article
genre Journal Article
id rss_article:5847
institution FRELIP
journal_source_facet Logical Methods in Computer Science
publishDate 2019
publishDateSort 2019
record_format rss_article
spellingShingle Capturing Polynomial Time using Modular Decomposition
Computer Science & Information Science
Computer Science & IT
Engineering & Technology
sub_discipline_display Computer Science & IT
sub_discipline_facet Computer Science & IT
subject_display Computer Science & Information Science
Computer Science & IT
Engineering & Technology
Computer Science & Information Science
Computer Science & IT
Engineering & Technology
subject_facet Computer Science & Information Science
Computer Science & IT
Engineering & Technology
title Capturing Polynomial Time using Modular Decomposition
title_auth Capturing Polynomial Time using Modular Decomposition
title_full Capturing Polynomial Time using Modular Decomposition
title_fullStr Capturing Polynomial Time using Modular Decomposition
title_full_unstemmed Capturing Polynomial Time using Modular Decomposition
title_short Capturing Polynomial Time using Modular Decomposition
title_sort capturing polynomial time using modular decomposition
topic Computer Science & Information Science
Computer Science & IT
Engineering & Technology
url https://doi.org/10.23638/LMCS-15(1:24)2019