Results 31 to 40 of about 9,271 (238)
On Contracting Graphs to Fixed Pattern Graphs
, 2010 For a fixed graph H, the H-Contractibility problem asks if a graph is H-contractible, i.e., can be transformed into H via a series of edge contractions. The computational complexity classification of this problem is still open. So far, H has a dominating vertex in all cases known to be polynomially solvable, whereas H does not have such a vertex in all
Pim van 't Hof +4 more
openaire +4 more sources
Journal of Combinatorial Theory, Series B, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Contraction–Deletion Invariants for Graphs
Journal of Combinatorial Theory, Series B, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Béla Bollobás +2 more
openaire +2 more sources
qTorch: The quantum tensor contraction handler.
PLoS ONE, 2018 Classical simulation of quantum computation is necessary for studying the numerical behavior of quantum algorithms, as there does not yet exist a large viable quantum computer on which to perform numerical tests.
E Schuyler Fried +5 more
doaj +1 more source
Contractibility and the clique graph operator
Discrete Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Francisco Larrión +2 more
openaire +1 more source
Contractions in Persistence and Metric Graphs
Bulletin of the Malaysian Mathematical Sciences Society, 2022 We prove that the existence of a $1$-Lipschitz retraction (a contraction) from a space $X$ onto its subspace $A$ implies the persistence diagram of $A$ embeds into the persistence diagram of $X$. As a tool we introduce tight injections of persistence modules as maps inducing the said embeddings.
openaire +2 more sources
Increasing the minimum degree of a graph by contractions [PDF]
Theoretical Computer Science, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Petr A. Golovach +3 more
openaire +8 more sources
Contracting Bipartite Graphs to Paths and Cycles [PDF]
Electronic Notes in Discrete Mathematics, 2017 9 pages, 2 ...
Konrad K. Dabrowski, Daniël Paulusma
openaire +6 more sources
A Bibliometric Analysis of Publications in Uremic Toxins From 1991 to 2024
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Uremic toxins are a growing area of research in nephrology, with significant implications in the progression and treatment of chronic kidney disease (CKD) and the management of end‐stage kidney disease (ESKD). This bibliometric analysis aims to evaluate the global research trends, key contributors, and the impact of publications in ...
Yuh‐Shan Ho +7 more
wiley +1 more source
Molecular Oncology, EarlyView.Intratumour heterogeneity complicates precision management of advanced endometrial cancer. Circulating tumor DNA (ctDNA) offers a minimally invasive strategy to capture tumor evolution and therapeutic resistance. Here, we compare tumor‐agnostic NGS with tumor‐informed ddPCR, outlining their relative sensitivity, concordance, and clinical implications ...
Carlos Casas‐Arozamena +15 more
wiley +1 more source