Results 181 to 190 of about 1,017,247 (314)
On bipartite tetravalent graphs
Discrete Mathematics, 1974 In this paper the determination of all distance-transitive graphs of valency four is completed.
openaire +1 more source
Decomposing Berge graphs and detecting balanced skew partitions [PDF]
We prove that the problem of deciding whether a graph has a balanced skew partition is NP-hard. We give an O(n9)-time algorithm for the same problem restricted to Berge graphs.
Nicolas Trotignon
core
Methods in Ecology and Evolution, EarlyView.Abstract Ecological communities are complex and exhibit considerable spatial variability, presenting challenges in accurately understanding these systems. A primary obstacle in ecological research is the existence of ‘missing links’ between species: inevitable unobserved interactions that limit our comprehension of ecological networks and their ...
Kesem Abramov +4 more
wiley +1 more source
Discrete Mathematics, 1986 Let \(A_{ij}\) be a binary triangle with base \(a_{1j}\), \(1\leq j\leq n\) such that \(a_{ij}=a_{i-1,j-1}+a_{i-1,j}\) for ...
openaire +2 more sources
Star Decompositions of Bipartite Graphs [PDF]
, 2015 In Chapter 1, we will introduce the definitions and the notations used throughout this thesis. We will also survey some prior research pertaining to graph decompositions, with special emphasis on star-decompositions and decompositions of bipartite graphs.
Lim, Jin Sean, Lim, Nick Jin Sean
core
Animal Conservation, EarlyView.The potential impact of bat species extinction on the number of their ectoparasitic fly species, based on interaction data for Brazil. As bat host species are removed over time, more connected species (green) would experience steeper declines and lead to greater ectoparasite losses when compared to a random extinction model (gray).
Nathan Lorenzo de Sena Gotti +3 more
wiley +1 more source
Partitioning 3-colored complete graphs into three monochromatic cycles [PDF]
, 2011 We show in this paper that in every 3-coloring of the edges of Kn all but o(n) of its vertices can be partitioned into three monochromatic cycles. From this, using our earlier results, actually it follows that we can partition all the vertices into at
Gyárfás, András +3 more
core
Identifiability conditions in cognitive diagnosis: Implications for Q‐matrix estimation algorithms
British Journal of Mathematical and Statistical Psychology, EarlyView.Abstract The Q‐matrix of a cognitively diagnostic assessment (CDA), documenting the item‐attribute associations, is a key component of any CDA. However, the true Q‐matrix underlying a CDA is never known and must be estimated—typically by content experts.
Hyunjoo Kim +2 more
wiley +1 more source
Story2Board: A Training‐Free Approach for Expressive Visual Storytelling
Computer Graphics Forum, EarlyView.Abstract We present Story2Board, a training‐free framework for expressive storyboard generation from natural language. Existing methods narrowly focus on subject identity, overlooking key aspects of visual storytelling such as spatial composition, background evolution, and narrative pacing.
D. Dinkevich +4 more
wiley +1 more source
Quantitative Metrics for Edge Bundling of Network Visualizations
Computer Graphics Forum, EarlyView.Abstract Edge bundling is widely used for reducing visual clutter in large 2D network and trajectory visualizations. Various edge bundling methods have been proposed, each producing qualitatively distinct outputs for the same data; however, few quantitative metrics exist for systematic evaluation. In this paper, we propose a set of quantitative metrics
M. Wallinger +3 more
wiley +1 more source