Results 111 to 120 of about 5,057 (262)
Two forbidden induced subgraphs and well-quasi-ordering
, 2011 It is known that a class of graphs defined by a single forbidden induced subgraph G is well-quasi-ordered by the induced subgraph relation if and only if G is an induced subgraph of P(4).
Nicholas Korpelainen +4 more
core +1 more source
MAXIMISING THE NUMBER OF CONNECTED INDUCED SUBGRAPHS OF UNICYCLIC GRAPHS [PDF]
, 2020 Denote by G(n, d, g, k) the set of all connected graphs of order n, having d > 0 cycles, girth g and k pendent vertices. In this paper, we give a partial characterisation of the structure of all maximal graphs in G(n, d, g, k) for the number of connected
Dossou-Olory, Audace Amen Vioutou
core
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 +6 more
wiley +1 more source
Discovering frequent induced subgraphs from directed networks
, 2018 Directed networks find many applications in computer science, social science and biomedicine, among others. In this paper we propose a new graph mining algorithm that is capable of locating all frequent induced subgraphs in a given set of directed ...
Zhang, Sen +3 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 +3 more
wiley +1 more source
Discussiones Mathematicae Graph Theory, 2018 Let 𝒫 be an arbitrary class of graphs that is closed under taking induced subgraphs and let 𝒞 (𝒫) be the family of forbidden subgraphs for 𝒫. We investigate the class 𝒫 (k) consisting of all the graphs G for which the removal of no more than k vertices ...
Borowiecki Mieczysław +2 more
doaj +1 more source
, 2021 We propose exact count formulae for the 21 topologically distinct non-induced connected subgraphs on five nodes,in simple, unweighted and undirected graphs.
Lawford, Steve
core
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 +6 more
wiley +1 more source
On Forbidden Induced Subgraphs for Unit Disk Graphs [PDF]
, 2018 A unit disk graph is the intersection graph of disks of equal radii in the plane. The class of unit disk graphs is hereditary, and therefore admits a characterization in terms of minimal forbidden induced subgraphs. In spite of quite active study of unit
Viktor Zamaraev +3 more
core +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 +6 more
wiley +1 more source