Results 11 to 20 of about 166,475 (217)
Finding Large Clique Minors is Hard
Journal of Graph Algorithms and Applications, 2009 We prove that it is NP-complete, given a graph G and a parameter h, to determine whether G contains a complete graph Kh as a minor.
David Eppstein
doaj +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
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
Planar Induced Subgraphs of Sparse Graphs
Journal of Graph Algorithms and Applications, 2015 We show that every graph has an induced pseudoforest of at least n−m/4.5 vertices, an induced partial 2-tree of at least n−m/5 vertices, and an induced planar subgraph of at least n−m/5.2174 vertices. These results are constructive, implying linear-time
Glencora Borradaile +2 more
doaj +1 more source
Flows in One-Crossing-Minor-Free Graphs
Journal of Graph Algorithms and Applications, 2013 We study the maximum flow problem in directed H-minor-free graphs where H can be drawn in the plane with one crossing. If a structural decomposition of the graph as a clique-sum of planar graphs and graphs of constant complexity is given, we show that a ...
Erin Wolf Chambers, David Eppstein
doaj +1 more source
Equitable colorings of $K_4$-minor-free graphs
Journal of Graph Algorithms and Applications, 2017 We demonstrate that for every positive integer $\Delta$, every $K_4$-minor-free graph with maximum degree $\Delta$ admits an equitable coloring with $k$ colors where $k\ge\frac{\Delta+3}{2}$.
Rémi de Joannis de Verclos +1 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
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