Results 41 to 50 of about 505,548 (331)
Formalizing Randomized Matching Algorithms [PDF]
Logical Methods in Computer Science, 2012 Using Je\v{r}\'abek 's framework for probabilistic reasoning, we formalize the correctness of two fundamental RNC^2 algorithms for bipartite perfect matching within the theory VPV for polytime reasoning.
Dai Tri Man Le, Stephen A. Cook
doaj +1 more source
NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs
, 2020 In 1988, Vazirani gave an NC algorithm for computing the number of perfect matchings in $K_{3,3}$-minor-free graphs by building on Kasteleyn's scheme for planar graphs, and stated that this "opens up the possibility of obtaining an NC algorithm for ...
Eppstein, David, Vazirani, Vijay V.
core +1 more source
A note on pm-compact bipartite graphs
Discussiones Mathematicae Graph Theory, 2014 A graph is called perfect matching compact (briefly, PM-compact), if its perfect matching graph is complete. Matching-covered PM-compact bipartite graphs have been characterized. In this paper, we show that any PM-compact bipartite graph G with δ (G) ≥ 2
Liu Jinfeng, Wang Xiumei
doaj +1 more source
On perfect and quasiperfect dominations in graphs [PDF]
Filomat, 2017 Asubset S ? V in a graph G=(V,E) is a k-quasiperfect dominating set (for k ? 1) if every vertex not in S is adjacent to at least one and at most k vertices in S. The cardinality of a minimum k-quasiperfect dominating set in G is denoted by 1k(G). Those sets were first introduced by Chellali et al.
Hernando Martín, María del Carmen +4 more
openaire +6 more sources
Perfect forests in graphs and their extensions [PDF]
Journal of Graph Theory, 2022 AbstractLet be a graph on vertices. For , a spanning forest of is called an ‐perfect forest if every tree in is an induced subgraph of and exactly vertices of have even degree (including zero). An ‐perfect forest of is proper if it has no vertices of degree zero.
Gutin, Gregory, Yeo, Anders
openaire +5 more sources
OPEN PACKING NUMBER FOR SOME CLASSES OF PERFECT GRAPHS
Ural Mathematical Journal, 2020 Let \(G\) be a graph with the vertex set \(V(G)\). A subset \(S\) of \(V(G)\) is an open packing set of \(G\) if every pair of vertices in \(S\) has no common neighbor in \(G.\) The maximum cardinality of an open packing set of \(G\) is the open ...
K. Raja Chandrasekar, S. Saravanakumar
doaj +1 more source
A characterization of perfect graphs
Journal of Combinatorial Theory, Series B, 1972 AbstractIt is shown that a graph is perfect iff maximum clique · number of stability is not less than the number of vertices holds for each induced subgraph. The fact, conjectured by Berge and proved by the author, follows immediately that the complement of a perfect graph is perfect.
openaire +3 more sources
A characterization of star-perfect graphs
AKCE International Journal of Graphs and CombinatoricsMotivated by Berge perfect graphs, we define star-perfect graphs and characterize them. For a finite simple graph G(V, E), let [Formula: see text] denote the minimum number of induced stars contained in G such that the union of their vertex sets is V(G),
G Ravindra +3 more
doaj +1 more source
Design method of nonsubsampled graph filter banks
Dianzi Jishu Yingyong, 2019 In order to overcome the problem that it is difficult to accurately define the downsampling operation for a generalized graph signal in graph filter banks, this paper focuses on the design algorithm of nonsubsampled graph filter banks.
Yang Sheng
doaj +1 more source
Electronic Notes in Discrete Mathematics, 1999 Two graphs \(G\) and \(H\) on the vertex set \(V\) are \(P_4\)-isomorphic if there is a permutation \(\pi\) on \(V\) such that, for all subsets \(S\) of \(V\), \(S\) induces a chordless \(P_4\) in \(G\) if and only if \(\pi (S)\) induces a \(P_4\) in \(H\). The author characterizes all graphs \(P_4\)-isomorphic to a bipartite graph. For example, we can
openaire +3 more sources