Buscar recursos académicos

Graph-based pangenome references often misrepresent Copy Number Variations (CNVs) and Variable Number Tandem Repeats (VNTRs) as alternative acyclic paths, which hinders downstream analyses, degrades alignment behavior, a...

Digital research artifacts (articles, datasets, software, etc.) are the basis for scientific research. Due to the continuous growth and complexity (e.g., due to formats) of such artifacts, ensuring their organization and...

Motivated by Khovanov homology and relations between the Jones polynomial and graph polynomials, we construct a homology theory for embedded graphs from which the chromatic polynomial can be recovered as the Euler charac...

The thinness of a graph is a width parameter that generalizes some properties of interval graphs, which are exactly the graphs of thinness one. Many NP-complete problems can be solved in polynomial time for graphs with b...

Abstract Heterogeneous graphs are widely employed in applications such as social networks, recommendation systems, and bioinformatics. However, node attributes in real-world heterogeneous graphs are often missing or corr...

This is the first of two chapters of a work in which we consider the unrestricted, minimal, and bounded representation problems for unit interval (UIG) and unit circular-arc (UCA) graphs. In the unrestricted version, a p...

We consider a system of composite bosons given by strongly bound fermion pairs tunneling through sites that form a low-dimensional network. It has been shown that the ground state of this system can have condensatelike p...

Vertex and edge operations are very popular tools in studying several properties of graphs, as they help us to calculate complex statements by means of easier or well-known ones. Deletion is probably the most important g...

Given a positive integer k, the {k}-packing function problem ({k}PF) is to find in a given graph G, a function f of maximum weight that assigns a non-negative integer to the vertices of G in such a way that the sum of f(...

Graph-based text classification has become an effective paradigm for modeling corpus-level structure, particularly under limited supervision. However, most existing approaches rely on document–word representations...

In this work we obtain a new graph class where the {. k}-dominating function problem ({. k}-DOM) is NP-complete: the class of chordal graphs. We also identify some maximal subclasses for which it is polynomial time solva...

RDF has seen increased adoption in recent years, prompting the standardization of the SPARQL query language for RDF, and the development of local and distributed engines for processing SPARQL queries. This survey paper p...

Augmented marked graphs possess a special structure for modelling common resources as well as some desirable properties pertaining to liveness, boundedness, reversibility and conservativeness. This paper investigates the...

"This paper presents a control technique based on distributed population dynamics under time-varying communication graphs for a multi-agent system structured in a leader-follower fashion. Here, the leader agent follows a...

"Temporal property graph databases track the evolution over time of nodes, properties, and edges in graphs. Computing temporal paths in these graphs is hard. In this paper we focus on indexing Continuous Paths, defined a...

Interactions become essential in Visualization because they enable users to adapt the visual representation to their own needs allowing them to explore the underlying information space. By using non-conventional devices,...

A legal dominating sequence of a graph is an ordered dominating set of vertices where each element dominates at least another one not dominated by its predecessors in the sequence. The length of a largest legal dominatin...

Traffic congestion degrades urban mobility and economic productivity, yet existing sensor-based monitoring systems detect only where congestion occurs without distinguishing its underlying infrastructure causes. This pap...

Buscou-se, neste trabalho, construir a rede de relações sociais entre pré-escolares e analisar a pertinência das metodologias utilizadas para a coleta e análise dos dados. Participaram dezessete pré-escolares de um...

Abstract Collaborative filtering and neural recommendation models have advanced substantially over the past decade, yet they frequently struggle to capture the fine-grained structure of user preferences and the rich, mul...

IntroductionRapid advances in digital technology have significantly increased the auditing industry's demand for interdisciplinary talent. However, current digital-intelligent auditing courses in higher education still f...

Organizations have become highly reliant on a range of data sources that span structured, semi-structured, and unstructured data types. These repositories allow large-scale storage for faster ingestion and analytics but ...

Abstract Graph Neural Networks have emerged as a powerful paradigm for artificial intelligence driven drug discovery, offering molecular representation learning that surpasses many conventional approaches. Traditional ex...

Abstract Credit risk assessment is a critical function in financial analytics, requiring models that can adapt to diverse borrower profiles while providing clear and interpretable insights. Although a range of data drive...