Counting the number of solutions of KDMDGP instances

Leo Liberti; Carlile Lavor; Jorge Alencar; Germano Abud

doi:10.1007/978-3-642-40020-9_23

Counting the number of solutions of ^KDMDGP instances

Leo Liberti
, Carlile Lavor
, Jorge Alencar
, Germano Abud

IBM Watson Research Center
University of Campinas (UNICAMP)

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

Résumé

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

langue originale	Anglais
titre	Geometric Science of Information - First International Conference, GSI 2013, Proceedings
Pages	224-230
Nombre de pages	7
Les DOIs	https://doi.org/10.1007/978-3-642-40020-9_23
état	Publié - 8 oct. 2013
Evénement	1st International SEE Conference on Geometric Science of Information, GSI 2013 - Paris, France Durée: 28 août 2013 → 30 août 2013

Série de publications

Nom	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8085 LNCS
ISSN (imprimé)	0302-9743
ISSN (Electronique)	1611-3349

Une conférence

Une conférence	1st International SEE Conference on Geometric Science of Information, GSI 2013
Pays/Territoire	France
La ville	Paris
période	28/08/13 → 30/08/13

Accès au document

10.1007/978-3-642-40020-9_23

Contient cette citation

Liberti, L., Lavor, C., Alencar, J., & Abud, G. (2013). Counting the number of solutions of ^KDMDGP instances. Dans Geometric Science of Information - First International Conference, GSI 2013, Proceedings (p. 224-230). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol 8085 LNCS). https://doi.org/10.1007/978-3-642-40020-9_23

@inproceedings{af6298eab02f411199d9501ac9cec8b4,

title = "Counting the number of solutions of KDMDGP instances",

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

author = "Leo Liberti and Carlile Lavor and Jorge Alencar and Germano Abud",

year = "2013",

month = oct,

day = "8",

doi = "10.1007/978-3-642-40020-9\_23",

language = "English",

isbn = "9783642400193",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "224--230",

booktitle = "Geometric Science of Information - First International Conference, GSI 2013, Proceedings",

note = "1st International SEE Conference on Geometric Science of Information, GSI 2013 ; Conference date: 28-08-2013 Through 30-08-2013",

}

Liberti, L, Lavor, C, Alencar, J & Abud, G 2013, Counting the number of solutions of ^KDMDGP instances. Dans Geometric Science of Information - First International Conference, GSI 2013, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOL. 8085 LNCS, p. 224-230, 1st International SEE Conference on Geometric Science of Information, GSI 2013, Paris, France, 28/08/13. https://doi.org/10.1007/978-3-642-40020-9_23

Counting the number of solutions of ^KDMDGP instances. / Liberti, Leo; Lavor, Carlile; Alencar, Jorge et al.
Geometric Science of Information - First International Conference, GSI 2013, Proceedings. 2013. p. 224-230 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol 8085 LNCS).

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

TY - GEN

T1 - Counting the number of solutions of KDMDGP instances

AU - Liberti, Leo

AU - Lavor, Carlile

AU - Alencar, Jorge

AU - Abud, Germano

PY - 2013/10/8

Y1 - 2013/10/8

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

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

U2 - 10.1007/978-3-642-40020-9_23

DO - 10.1007/978-3-642-40020-9_23

M3 - Conference contribution

AN - SCOPUS:84884913537

SN - 9783642400193

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 224

EP - 230

BT - Geometric Science of Information - First International Conference, GSI 2013, Proceedings

T2 - 1st International SEE Conference on Geometric Science of Information, GSI 2013

Y2 - 28 August 2013 through 30 August 2013

ER -

Liberti L, Lavor C, Alencar J, Abud G. Counting the number of solutions of ^KDMDGP instances. Dans Geometric Science of Information - First International Conference, GSI 2013, Proceedings. 2013. p. 224-230. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-40020-9_23