Results 111 to 120 of about 3,550,540 (296)
Book Embeddings of k-Map Graphs
, 2020 A map is a partition of the sphere into regions that are labeled as countries or holes. The vertices of a map graph are the countries of a map. There is an edge if and only if the countries are adjacent and meet in at least one point. For a k-map graph, at most k countries meet in a point.
openaire +2 more sources
Journal of the Association for Information Science and Technology, EarlyView.Abstract In today's digital age, misinformation propagates rapidly through digital channels, blurring the lines between truth and fiction, and challenging the foundations of trust in information sources. Although affecting all spheres of life, misinformation poses a significant threat to workers highlighting a critical intersection between ...
Ashwani Malhotra +4 more
wiley +1 more source
Why is it difficult to implement e-health initiatives? A qualitative study
Implementation Science, 2011 Background The use of information and communication technologies in healthcare is seen as essential for high quality and cost-effective healthcare.
Wallace Paul +6 more
doaj +1 more source
Book Review: Embedding problems in symplectic geometry [PDF]
, 2006 Lisa Traynor
openalex +1 more source
Journal of the Association for Information Science and Technology, EarlyView.Abstract To unravel the linguistic dynamics of science communication on social media, this study presents a large‐scale, cross‐disciplinary analysis of language use in over 21 million Twitter mentions of 6.7 million scientific publications. While English dominates—accounting for 90.8% of all mentions and serving as a bridging language for the ...
Yanqing Zhang, Zhichao Fang
wiley +1 more source
Bulletin of the History of Archaeology, 2008 While the general history of archaeology has received a growing interest lately1, these efforts still lack a common research-guiding agenda. Furthermore, most of the studies still concentrate on biographies and event history. The
Nils Müller-Scheessel
doaj +1 more source
The Matching Book Embedding of Biconnected Outerplanar Graphs
, 2020 The $n$-$book ~embedding$ of a graph $G$ is an embedding of the graph $G$ in an $n$-book with the vertices of $G$ on the spine and each edge to the pages without crossing each other. If the degree of vertices of $G$ at most one in each page, the $n$-book embedding is $matching$.
Shao, Zeling, Liu, Yanqing, Li, Zhiguo
openaire +2 more sources
Journal of the Association for Information Science and Technology, EarlyView.Abstract Researchers increasingly share data, both on their own initiative and as a result of requirements by funding agencies and publishers. For data to be accessible and reusable, it must be understandable. While typical metadata covers rudimentary information about data, data re‐users often need more contextual information, including paradata ...
Isto Huvila, Lisa Andersson, Olle Sköld
wiley +1 more source
On open books and embedding of smooth and contact manifolds
, 2020 19 pages, 6 ...
Nath, Arijit, Saha, Kuldeep
openaire +2 more sources
Equivalence of Heegaard Floer homology and embedded contact homology via open book decompositions [PDF]
, 2011 Vincent Colin, Paolo Ghiggini, Ko Honda
openalex +1 more source