Skip to main content
Conference Proceedings

Counting maximal independent sets in subcubic graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7147 LNCS 325-336
DOI: 10.1007/978-3-642-27660-6_27
2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The main result of this paper is an algorithm counting maximal independent sets in graphs with maximum degree at most 3 in time O *(1. 2570 n) and polynomial space. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Junosza-Szaniawski, K., & Tuczyński, M. (2012). Counting maximal independent sets in subcubic graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7147 LNCS, pp. 325–336). https://doi.org/10.1007/978-3-642-27660-6_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free