Results 51 to 60 of about 5,057 (262)
Certifying Induced Subgraphs in Large Graphs
Journal of Graph Algorithms and Applications, 2023 We introduce I/O-efficient certifying algorithms for the recognition of bipartite, split, threshold, bipartite chain, and trivially perfect graphs. When the input graph is a member of the respective class, the certifying algorithm returns a certificate that characterizes this class.Otherwise, it returns a forbidden induced subgraph as a certificate for
Ulrich Meyer 0001 +2 more
openaire +2 more sources
Advanced Intelligent Systems, EarlyView.We present a novel AI‐integrated implantation‐on‐chip platform that enables mimicking and monitoring the maternal–fetal interactions at the early phases of human embryo implantation with high spatiotemporal resolution. The complexity of the trophoblast invasion process was addressed by conducting the analysis at global (rate of invasion) and local ...
Joanna Filippi +12 more
wiley +1 more source
Excluding induced subgraphs II: extremal graphs
, 1993 In this paper we study properties of the classes of graphs not containing a fixed subgraph H as an induced subgraph. In particular, we introduce a new parameter τ(H) and show that fundamental results of extremal graph theory for weak subgraphs carry over
Prömel, H.J., Steger, A.
core +1 more source
Electronic Notes in Discrete Mathematics, 2017 In descending generality I survey: five partial orderings of graphs, the induced-subgraph ordering, and examples like perfect, threshold, and mock threshold graphs. The emphasis is on how the induced subgraph ordering differs from other popular orderings and leads to different basic questions.
openaire +2 more sources
On maximum planar induced subgraphs
Discrete Applied Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luérbio Faria +4 more
openaire +2 more sources
On structural controllability in complex networks with periodic switching topologies
Asian Journal of Control, EarlyView.Abstract This paper investigates the structural controllability of complex networks with periodic switching topologies. First, several graph transformations that preserve structural controllability are demonstrated. Based on the n‐walk theory, a criterion is derived that determines structural controllability by analyzing only the joint graph within a ...
Jingrui Hou +3 more
wiley +1 more source
Induced subgraphs of hypercubes
European Journal of Combinatorics, 2013 Let $Q_k$ denote the $k$-dimensional hypercube on $2^k$ vertices. A vertex in a subgraph of $Q_k$ is {\em full} if its degree is $k$. We apply the Kruskal-Katona Theorem to compute the maximum number of full vertices an induced subgraph on $n\leq 2^k$ vertices of $Q_k$ can have, as a function of $k$ and $n$. This is then used to determine $\min(\max(|V(
openaire +2 more sources
Machine Learning Paradigm for Advanced Battery Electrolyte Development
Carbon Energy, EarlyView.Electrolyte materials determine ion transport kinetics within the bulk and interphases, ultimately influencing the performance of battery systems. As data‐driven paradigms increasingly reshape materials discovery, this review provides an application‐oriented exploration of the intersection between machine learning and electrolyte science. By evaluating
Chang Su +4 more
wiley +1 more source
Forbidden substructures: induced subgraphs, Ramsey games, and sparse hypergraphs [PDF]
, 2012 We study problems in extremal combinatorics with respect to forbidden induced subgraphs, forbidden colored subgraphs, and forbidden subgraphs. In Chapter 2, we determine exactly which graphs H have the property that almost every H-free graph has a vertex
Butterfield, Jane
core
Maximum weighted induced subgraphs
Discrete Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jochen Harant, Samuel Mohr
openaire +2 more sources