4 citations · 6 across the 10 of their papers we have counts for
17 papers
Sparse vertex cutsets and the maximum degree
Stéphane Bessy, Johannes Rauch, Dieter Rautenbach +1
We show that every graph of maximum degree and sufficiently large order has a vertex cutset of order at most that induces a subgraph of maximum degree at mos…
Computing the Best Case Energy Complexity of Satisfying Assignments in Monotone Circuits
Janio Carlos Nascimento Silva, Uéverton S. Souza
Measures of circuit complexity are usually analyzed to ensure the computation of Boolean functions with economy and efficiency. One of these measures is energy complexity, which is…
Perfect matching cuts partitioning a graph into complementary subgraphs
Diane Castonguay, Erika M. M. Coelho, Hebert Coelho +2
In Partition Into Complementary Subgraphs (Comp-Sub) we are given a graph , and an edge set property , and asked whether can be decomposed into two graphs, and…
Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of
Linda Cook, Tomáš Masařík, Marcin Pilipczuk +2
An oriented graph is a digraph that does not contain a directed cycle of length two. An (oriented) graph is -free if does not contain as an induced sub(di)graph. The…
A note on independent sets in sparse-dense graphs
Uéverton S. Souza
Sparse-dense partitions was introduced by Feder, Hell, Klein, and Motwani [STOC 1999, SIDMA 2003] as a tool to solve partitioning problems. In this paper, the following result conc…
A tight quasi-polynomial bound for Global Label Min-Cut
Lars Jaffke, Paloma T. Lima, Tomáš Masařík +2
We study a generalization of the classic Global Min-Cut problem, called Global Label Min-Cut (or sometimes Global Hedge Min-Cut): the edges of the input (multi)graph are labeled (o…