The identifying code problem is a newly emerging search problem, challenging both from a theoretical and a computational point of view, even for special graphs like bipartite graphs. Hence, a typical line of attack for ...

The members of the management team of the Digital Library of Academic Journals (BDP) of the Federal University of Parana (UFPR) presents the main concepts and clarify questions about the Digital Object Identifier (DOI).

The objective of this international conference was 'to identify issues of concern with regard to electronic publishing and to advise on future action for the benefit of science.The objective of this international conference ...

This article discusses how libraries can include person identifiers in the MARC format. It suggests using URIs in fields and subfields to help transition the data to an RDF model, and to help prepare the catalog for a ...

The nonequivalent groups with anchor test (NEAT) design is widely used in test equating. Under this design, two groups of examinees are administered different test forms with each test form containing a subset of common ...

The identifying code problem is a special search problem, challenging both from a theoretical and from a computational point of view, even for several graphs where other usually hard problems are easy to solve, like bipartite ...

In the search for a dynamic programming-based algorithm derived from the modular decomposition of graphs, we analyze the behavior of the identifying code number under disjoint union and join operations. This study lead us ...