Results 51 to 60 of about 564 (166)

Assessing Capability Complexity Using Enterprise Architecture Framework

Systems Engineering, EarlyView.
ABSTRACT This study proposes a structured and quantitative methodology to evaluate the holistic complexity of system‐of‐systems (SoSs), employing the Zachman Architecture Framework (ZAF) as its foundational analytical tool. A five‐phase analytical procedure is developed and empirically validated, encompassing: (1) refinement of complexity measures, (2)
Javad Bakhshi, Mahmoud Efatmaneshnik
wiley   +1 more source

On the complexity of listing closed frequent subgraph patterns

, 2010
Given a graph class ${\cal L}$, a matching operator $\le$ (usually subgraph isomorphism), a multiset $DB$ of elements of ${\cal L}$ (the database) and a treshold $t$, the problem $F({\cal L},\le,DB,t)$ of frequent subgraph pattern mining is to list all ...
Haghir Chehreghani, Mostafa, Ramon, Jan
core  

Engineering Exact Quasi-Threshold Editing [PDF]

, 2020
Quasi-threshold graphs are {C₄, P₄}-free graphs, i.e., they do not contain any cycle or path of four nodes as an induced subgraph. We study the {C₄, P₄}-free editing problem, which is the problem of finding a minimum number of edge insertions or ...
Schoch, Philipp, Zühlsdorf, Sven, Gottesbüren, Lars, Wagner, Dorothea, Hamann, Michael, Strasser, Ben   +5 more
core   +1 more source

A tutorial on Bayesian model averaging for exponential random graph models

British Journal of Mathematical and Statistical Psychology, EarlyView.
Abstract The use of exponential random graph models (ERGMs) is becoming prevalent in psychology due to their ability to explain and predict the formation of edges between vertices in a network. Valid inference with ERGMs requires correctly specifying endogenous and exogenous effects as network statistics, guided by theory, to represent the network ...
Ihnwhi Heo, Jan‐Willem Simons, Haiyan Liu   +2 more
wiley   +1 more source

GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra

, 2021
We propose GraphMineSuite (GMS): the first benchmarking suite for graph mining that facilitates evaluating and constructing high-performance graph mining algorithms.
Leisinger, Sebastian, Copik, Marcin, Gianinazzi, Lukas, Tatkowski, Peter, Balla, Adrian, Besta, Maciej, Vonarburg-Shmaria, Zur, Schwarz, Leonardo, Lindenberger, Philipp, Hoefler, Torsten, Ozdemir, Esref, Holenstein, Tobias, Kalvoda, Pavel, Balla, Adrian; id_orcid, Janda, Kacper, Konieczny, Marek, Schaffner, Yannick, Beranek, Jakub, Mutlu, Onur, Kwasniewski, Grzegorz   +19 more
core   +1 more source

Noisy Graph Patterns via Ordered Matrices

Computer Graphics Forum, EarlyView.
Abstract The high‐level structure of a graph is a crucial ingredient for the analysis and visualization of relational data. However, discovering the salient graph patterns that form this structure is notoriously difficult for two reasons. (1) Finding important patterns, such as cliques and bicliques, is computationally hard.
J. Wulms, W. Meulemans, B. Speckmann
wiley   +1 more source

CLusterix: A Hybrid Visualization Model for Hierarchically Clustered Networks

Computer Graphics Forum, EarlyView.
Abstract We introduce Clusterix, a novel hybrid visualization model for representing hierarchically clustered networks, which also supports directed and weighted edges. Clusterix offers an integrated view of both the network and its full cluster hierarchy by compactly visualizing the cluster inclusion tree enriched with links of the network.
Carla Binucci, Annika Bonerath, Walter Didimo, Henry Förster, Seok‐Hee Hong, Maria Eleni Pavlidi, Alessandra Tappini   +6 more
wiley   +1 more source

Maximal strongly connected cliques in directed graphs: Algorithms and bounds

, 2021
International audienceFinding communities in the form of cohesive subgraphs is a fundamental problem in network analysis. In domains that model networks as undirected graphs, communities are generally associated with dense subgraphs, and many community ...
Conte, Alessio, Uno, Takeaki, Wasa, Kunihiro, Kanté, Mamadou Moustapha   +3 more
core   +1 more source

A Theoretical Approach for Structuring and Analysing Knowledge Provenance for Visual Analytics

Computer Graphics Forum, EarlyView.
VAKG unfolds the interactions within the current knowledge model (A) into a temporal knowledge graph (B), which is structured as a 4‐way graph containing two temporal (green) and two static (yellow) knowledge graphs. By using VAKG, one can structure and store the user's knowledge‐gathering process and all related interactions for eventual analysis (C).
L. Christino, S. Rezaeipour, E. Milios, F. Paulovich   +3 more
wiley   +1 more source

Transforming Solutions for the Oberwolfach Problem into Solutions for the Spouse‐Loving Variant

Journal of Combinatorial Designs, Volume 34, Issue 8, Page 361-377, August 2026.
ABSTRACT The Oberwolfach problem OP ( F ), for a 2‐factor F of K n, asks whether there exists a 2‐factorization of K n (if n is odd) or K n − I (if n is even) where each 2‐factor is isomorphic to F. Here, I denotes any 1‐factor of K n. For even n, the problem OP ( F ) may also be denoted OP − ( F ), and has been nicknamed the spouse‐avoiding variant ...
Maruša Lekše, Mateja Šajna
wiley   +1 more source