Results 201 to 210 of about 50,407 (255)

On the Hardness of Switching to a Small Number of Edges

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek   +2 more
wiley   +1 more source

To the Social Origin of Legal Terminology

open access: yesRussian Journal of Sociology, 2015
openaire   +1 more source

Clarifying the relationship between biomedical and health informatics and digital health: expert perspectives. [PDF]

open access: yesBMJ Health Care Inform
Degoulet P   +7 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy