A new approach to obtain EFMs using graph methods based on the shortest path between end nodes

  1. Céspedes, J.F.H.
  2. De Asís Guil Asensio, F.
  3. Carrasco, J.M.G.
Liburu bilduma:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ISSN: 1611-3349,  0302-9743

ISBN: 9783319164823

Argitalpen urtea: 2015

Alea: 9043

Orrialdeak: 641-649

Mota: Biltzar ekarpena

DOI: 10.1007/978-3-319-16483-0_62 GOOGLE SCHOLAR
Datuen iturria: Scopus