Results 121 to 130 of about 8,313 (308)

Subgraph Complementation [PDF]

, 2020
A subgraph complement of the graph G is a graph obtained from G by complementing all the edges in one of its induced subgraphs. We study the following algorithmic question: for a given graph G and graph class G, is there a subgraph complement of G which ...
Fomin, Fedor, Golovach, Petr, Fomin, Fedor V., Golovach, Petr A., Strømme, Torstein J. F., Thilikos, Dimitrios M., Strømme, Torstein   +6 more
core   +1 more source

DeepSeek‐Lattice‐KG: A Compact Language Model With Knowledge Graph Augmentation for Lattice Structure Design

Materials Genome Engineering Advances, EarlyView.
DeepSeek‐Lattice‐KG integrates a domain‐adapted 14B LLM with a Neo4j lattice knowledge graph distilled from 50,000 papers. It analyzes queries, retrieves supporting subgraphs, and generates grounded answers; on a 2100‐question, six‐domain benchmark, it achieves 94.8% accuracy.
Zhiyang Shu, Chao Wang, Changsheng Feng, Feiyu Zhou, Xueyan Chen, Yan Chen, Yilun Liu   +6 more
wiley   +1 more source

An induced subgraph characterization of domination perfect graphs [PDF]

, 1995
Let γ(G) ι(G) be the domination number and independent domination number of a graph (G), respectively. A graph (G) is called domination perfect if γ(H) = ι(H), for every induced subgraph H of (G).
Vadim E. Zverovich, Igor E. Zvervich, Zvervich, Igor E., Zverovich, Vadim, Zverovich, Igor, Zverovich, Vadim E.   +5 more
core   +1 more source

High Relative Accuracy Computations With Covariance Matrices of Order Statistics

Mathematical Methods in the Applied Sciences, EarlyView.
ABSTRACT In many statistical applications, numerical computations with covariance matrices need to be performed. The error made when performing such numerical computations increases with the condition number of the covariance matrix, which is related to the number of variables and the strength of the correlation between the variables. In a recent work,
Juan Baz, Pedro Alonso, Juan Manuel Peña, Raúl Pérez‐Fernández   +3 more
wiley   +1 more source

Characterizing the forbidden pairs for graphs to be super-edge-connected

AKCE International Journal of Graphs and Combinatorics
Let [Formula: see text] be a set of given connected graphs. A graph G is said to be [Formula: see text]-free if G contains no H as an induced subgraph for any [Formula: see text].
Hazhe Ye, Yingzhi Tian
doaj   +1 more source

Allocation of Indivisible Items With a Common Preference Graph: Minimizing Total Dissatisfaction

Networks, EarlyView.
ABSTRACT Allocating indivisible items among a set of agents is a frequently studied discrete optimization problem. In the setting considered in this work, the agents' preferences over the items are assumed to be identical. We consider a very recent measure for the overall quality of an allocation which does not rely on numerical valuations of the items.
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanič, Peter Muršič, Ulrich Pferschy   +6 more
wiley   +1 more source

On Ramsey (2K2, Wn)-minimal graphs of smallest order

Electronic Journal of Graph Theory and Applications
The notation F → (H, G) means that if all edges of F are arbitrarily colored by red or blue, then either the subgraph of F induced by all red edges contains a graph H or the subgraph of F induced by all blue edges contains a graph G.
Muhammad Rafif Fajri, Hilda Assiyatun, Edy Tri Baskoro   +2 more
doaj   +1 more source

On graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph [PDF]

We prove a decomposition theorem for graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph.Induced, subgraph, decomposition.
Nicolas Trotignon, Benjamin Lévêque, Frédéric Maffray   +2 more
core  

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

Search Result Clustering via Randomized Partitioning of Query-Induced Subgraphs [PDF]

Telfor Journal, 2009
In this paper, we present an approach to search result clustering, using partitioning of underlying link graph. We define the notion of "query-induced subgraph" and formulate the problem of search result clustering as a problem of efficient partitioning ...
A. Bradic
doaj