Results 1 to 10 of about 8,543 (180)
Randomized communication and implicit graph representations [PDF]
Symposium on the Theory of Computing, 2021 The most basic lower-bound question in randomized communication complexity is: Does a given problem have constant cost, or non-constant cost? We observe that this question has a deep connection to implicit graph representations in structural graph theory.
Nathaniel Harms +2 more
semanticscholar +1 more source
Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel [PDF]
SIAM Journal on Discrete Mathematics, 2020 We study the kernelization complexity of structural parameterizations of the Vertex Cover problem. Here, the goal is to find a polynomial-time preprocessing algorithm that can reduce any instance $(G,k)$ of the Vertex Cover problem to an equivalent one ...
Marin Bougeret, B. Jansen, Ignasi Sau
semanticscholar +1 more source
Perfect elimination orderings for symmetric matrices [PDF]
Optimization Letters, 2017 We introduce a new class of structured symmetric matrices by extending the notion of perfect elimination ordering from graphs to weighted graphs or matrices.
M. Laurent, Shin-ichi Tanigawa
semanticscholar +2 more sources
Triangle‐free equimatchable graphs [PDF]
Journal of Graph Theory, 2018 A graph is called equimatchable if all of its maximal matchings have the same size. Frendrup et al. provided a characterization of equimatchable graphs with girth at least 5.
Yasemin Büyükçolak +2 more
semanticscholar +1 more source
Forbidden induced subgraph characterization of circle graphs within split graphs [PDF]
Discrete Applied Mathematics, 2020 A graph is circle if its vertices are in correspondence with a family of chords in a circle in such a way that every two distinct vertices are adjacent if and only if the corresponding chords have nonempty intersection.
Flavia Bonomo-Braberman +3 more
semanticscholar +1 more source
A Characterization of K2, 4-Minor-Free Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2014 We provide a complete structural characterization of $K_{2,4}$-minor-free graphs. The 3-connected $K_{2,4}$-minor-free graphs consist of nine small graphs on at most eight vertices, together with a family of planar graphs that contains $2n-8 ...
M. Ellingham +3 more
semanticscholar +1 more source
The Structure of Well-Covered Graphs and the Complexity of Their Recognition Problems
J. Comb. Theory B, 1997 David Tankus, M. Tarsi
semanticscholar +1 more source
On subgraphs of Cartesian product graphs and S-primeness
Electron. Notes Discret. Math., 2004 B. Brešar
semanticscholar +1 more source
GPCRact: a hierarchical framework for predicting ligand-induced GPCR activity via allosteric communication modeling. [PDF]
Brief BioinformSon H, Yi GS.
europepmc +1 more source
On Block Ordering of Variables in Graphical Modelling
, 2006 A. Roverato, L. Rocca
semanticscholar +1 more source