Counting the number of solutions of KDMDGP instances

  • Leo Liberti
  • , Carlile Lavor
  • , Jorge Alencar
  • , Germano Abud

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We discuss a method for finding the number of realizations in ℝK of certain simple undirected weighted graphs.

Original languageEnglish
Title of host publicationGeometric Science of Information - First International Conference, GSI 2013, Proceedings
Pages224-230
Number of pages7
DOIs
Publication statusPublished - 8 Oct 2013
Event1st International SEE Conference on Geometric Science of Information, GSI 2013 - Paris, France
Duration: 28 Aug 201330 Aug 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8085 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference1st International SEE Conference on Geometric Science of Information, GSI 2013
Country/TerritoryFrance
CityParis
Period28/08/1330/08/13

Fingerprint

Dive into the research topics of 'Counting the number of solutions of KDMDGP instances'. Together they form a unique fingerprint.

Cite this