10 Result(s)
within
Conference Paper
Juhi Chaudhary
-
Chapter and Conference Paper
Multiresolution Analysis Based on Variants of Wavelet Transforms for Illumination Normalized Face Recognition
Face recognition has been recognized as an extensive biometric system in recent years that effectively identifies digital face images under any uncontrolled illumination situations. This often results in intra...
-
Chapter and Conference Paper
Parameterized Results on Acyclic Matchings with Implications for Related Problems
A matching M in a graph G is an acyclic matching if the subgraph of G induced by the endpoints of the edges of M is a forest. Given a graph G and a positive integer
-
Chapter and Conference Paper
Minimum Maximal Acyclic Matching in Proper Interval Graphs
Given a graph G, Min-Max-Acy-Matching is the problem of finding a maximal matching M in G of minimum cardinality such that the set of M-saturated vertices induces an acyclic subgraph in G. The decision version of...
-
Chapter and Conference Paper
\(\mathcal {P}\) -Matchings Parameterized by Treewidth
A matching is a subset of edges in a graph G that do not share an endpoint. A matching M is a \(\mathcal {P}\) -matching if the subgraph o...
-
Chapter and Conference Paper
Large Scale Double Density Dual Tree Complex Wavelet Transform Based Robust Feature Extraction for Face Recognition
Varying effects in face recognition often causes intrapersonal variations due to which efficient feature extraction is desirable. In this work, a significant feature extraction technique based on Double Densit...
-
Chapter and Conference Paper
On Two Variants of Induced Matchings
A matching M in a graph G is an induced matching if the subgraph of G induced by M is the same as the subgraph of G induced by $$S = \{v \in V...
-
Chapter and Conference Paper
On the Complexity of Minimum Maximal Acyclic Matchings
Given a graph G, Min-Max-Acy-Matching is the problem of finding a maximal matching M in G of minimum cardinality such that the set of M-saturated vertices induces an acyclic subgraph in G. Min-Max-Acy-Matching is...
-
Chapter and Conference Paper
On the Complexity of Minimum Maximal Uniquely Restricted Matching
A subset \(M\subseteq E\) M ⊆ E of edges of a graph \(G=(V,E)\) G = ( V , E ) is called a matching if no two edges of M share a common vertex. A matching M in a graph G is called a uniquely restricted...
-
Chapter and Conference Paper
Acyclic Matching in Some Subclasses of Graphs
A subset \(M\subseteq E\) of edges of a graph \(G=(V,E)\) is called a matching if no two edges of M share a common vertex. A matching M in a graph G is called an acyclic matching if G[V(M)], the subgraph of G in...
-
Chapter and Conference Paper
Dominating Induced Matching in Some Subclasses of Bipartite Graphs
Given a graph \(G=(V,E)\) , a set $$M\su...
