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
Tumor relevant protein functional interactions identified using bipartite graph analyses. [PDF]
Sci Rep, 2021 Venkatraman DL +3 more
europepmc +1 more source
The enumeration of bipartite graphs
Discrete Mathematics, 1979 AbstractThe standard construction of graphs with n connected components is modified here for bicolored graphs by letting Sn × H act on the function space Y∗where X={1,2,…,n}, Y is the set of connected bicolored graphs, and H is the group that interchanges the vertex colors.
openaire +2 more sources
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
Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm. [PDF]
Front Pharmacol, 2022 Kusuma WA +6 more
europepmc +1 more source
Word-representability of co-bipartite graph [PDF]
A graph $G = (V, E)$ is word-representable, if there exists a word $w$ over the alphabet $V$ such that for letters $\{x,y\}\in V$, $x$ and $y$ alternate in $w$ if and only if $xy \in E$.
Das, Biswajit +1 more
core +2 more sources
Bipartite Approximation for Graph Wavelet Signal Decomposition
, 2017 To compactly represent a graph signal in the frequency domain, critically sampled biorthogonal wavelet filterbanks have been proposed to decompose signals on bipartite graphs.
Jin Zeng +5 more
core +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
Computing the permanental polynomial of 4k-intercyclic bipartite graphs
The American Journal of CombinatoricsLet \(G\) be a bipartite graph with adjacency matrix \(A(G)\). The characteristic polynomial \(\phi(G,x)=\det(xI-A(G))\) and the permanental polynomial \(\pi(G,x) = \operatorname{per}(xI-A(G))\) are both graph invariants used to distinguish graphs.
Ravindra Bapat +2 more
doaj +1 more source
A note on star coloring of central graph of bipartite graph and corona graph of complete graph with path and cycle [PDF]
Transactions on Combinatorics, 2012 In this paper, we find the star chromatic number of central graph of complete bipartite graph and corona graph of complete graph with path and cycle.
V. J. Vernold, M. Venkatachalam
doaj