On representing graphs as membership digraphs - A proof scenario checked by Referee

Eugenio Omodeo; Alexandru Ioan Tomescu

On representing graphs as membership digraphs - A proof scenario checked by Referee

Eugenio Omodeo
, Alexandru Ioan Tomescu

Tutkimustuotos: Ei-tekstimuotoinen › Ohjelmisto › Tieteellinen

Alkuperäiskieli	englanti
Tila	Julkaistu - 2015
OKM-julkaisutyyppi	I2 Tieto- ja viestintätekniset sovellukset

Lisätietoja

This proof scenario accompanies the paper: Eugenio G. Omodeo, Alexandru I. Tomescu, Set Graphs. V. On representing graphs as membership digraphs, Journal of Logic and Computation 25(3), 899-919, 2015

Tieteenalat

113 Tietojenkäsittely- ja informaatiotieteet

Pääsy asiakirjaan

http://www2.units.it/eomodeo/GraphsViaMembership.html

Siteeraa tätä

@misc{f6dafcde38ba446eb6a1738380957a29,

title = "On representing graphs as membership digraphs - A proof scenario checked by Referee",

keywords = "113 Computer and information sciences",

author = "Eugenio Omodeo and Tomescu, \{Alexandru Ioan\}",

note = "This proof scenario accompanies the paper: Eugenio G. Omodeo, Alexandru I. Tomescu, Set Graphs. V. On representing graphs as membership digraphs, Journal of Logic and Computation 25(3), 899-919, 2015 ",

year = "2015",

language = "English",

}

TY - ADVS

T1 - On representing graphs as membership digraphs - A proof scenario checked by Referee

AU - Omodeo, Eugenio

AU - Tomescu, Alexandru Ioan

N1 - This proof scenario accompanies the paper: Eugenio G. Omodeo, Alexandru I. Tomescu, Set Graphs. V. On representing graphs as membership digraphs, Journal of Logic and Computation 25(3), 899-919, 2015

PY - 2015

Y1 - 2015

KW - 113 Computer and information sciences

M3 - Software

ER -