Skip to main content
Conference Proceedings

Counting the number of solutions of KDMDGP instances

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 8085 LNCS 224-230
DOI: 10.1007/978-3-642-40020-9_23
17Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We discuss a method for finding the number of realizations in ℝK of certain simple undirected weighted graphs. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Liberti, L., Lavor, C., Alencar, J., & Abud, G. (2013). Counting the number of solutions of KDMDGP instances. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8085 LNCS, pp. 224–230). https://doi.org/10.1007/978-3-642-40020-9_23

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