Results 21 to 30 of about 168,763 (311)
Monadic second-order definable graph orderings [PDF]
Logical Methods in Computer Science, 2014 We study the question of whether, for a given class of finite graphs, one can define, for each graph of the class, a linear ordering in monadic second-order logic, possibly with the help of monadic parameters.
Achim Blumensath, Bruno Courcelle
doaj +1 more source
Knowledge-Enhanced Dual-Channel GCN for Aspect-Based Sentiment Analysis
Mathematics, 2022 As a subtask of sentiment analysis, aspect-based sentiment analysis (ABSA) refers to identifying the sentiment polarity of the given aspect. The state-of-the-art ABSA models are developed by using the graph neural networks to deal with the semantics and ...
Zhengxuan Zhang +4 more
doaj +1 more source
Testing hereditary properties of nonexpanding bounded-degree graphs [PDF]
, 2007 We study graph properties that are testable for bounded-degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined graph property and graphs that are far from every graph having that property. It
Christian Sohler +5 more
core +1 more source
Discrete Applied Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Reinhard Diestel, Daniela Kühn
openaire +2 more sources
Graph Minors and Minimum Degree [PDF]
The Electronic Journal of Combinatorics, 2010 Let $\mathcal{D}_k$ be the class of graphs for which every minor has minimum degree at most $k$. Then $\mathcal{D}_k$ is closed under taking minors. By the Robertson-Seymour graph minor theorem, $\mathcal{D}_k$ is characterised by a finite family of minor-minimal forbidden graphs, which we denote by $\widehat{\mathcal{D}}_k$.
Gasper Fijavz, David R. Wood
openaire +3 more sources
Vertex sparsifiers : new results from old techniques [PDF]
, 2014 Given a capacitated graph $G = (V,E)$ and a set of terminals $K \subseteq V$, how should we produce a graph $H$ only on the terminals $K$ so that every (multicommodity) flow between the terminals in $G$ could be supported in $H$ with low congestion, and ...
Gupta, Anupam +10 more
core +1 more source
Bounds of Eigenvalues of K3,3-Minor Free Graphs
Journal of Inequalities and Applications, 2009 The spectral radius ρ(G) of a graph G is the largest eigenvalue of its adjacency matrix. Let λ(G) be the smallest eigenvalue of G. In this paper, we have described the K3,3-minor free graphs and showed that (A) let G be a simple graph with ...
Kun-Fu Fang
doaj +1 more source
Upgraded Thoth: Software for Data Visualization and Statistics
Analytics, 2023 Thoth is a free desktop/laptop software application with a friendly graphical user interface that facilitates routine data-visualization and statistical-calculation tasks for astronomy and astrophysical research (and other fields where numbers are ...
Russ R. Laher +16 more
doaj +1 more source
On the predictibility of A-minor motifs from their local contexts
RNA Biology, 2022 This study investigates the importance of the structural context in the formation of a type I/II A-minor motif. This very frequent structural motif has been shown to be important in the spatial folding of RNA molecules.
Coline Gianfrotta +4 more
doaj +1 more source
Graph model for the clustering of dark matter halos
Physical Review Research, 2023 We use network theory to study topological features in the hierarchical clustering of dark matter halos. We use public halo catalogs from cosmological N-body simulations and construct tree graphs that connect halos within main halo systems.
Daneng Yang, Hai-Bo Yu
doaj +1 more source