17 research outputs found
Feedback vertex set on chordal bipartite graphs
Let G=(A,B,E) be a bipartite graph with color classes A and B. The graph G is
chordal bipartite if G has no induced cycle of length more than four. Let
G=(V,E) be a graph. A feedback vertex set F is a set of vertices F subset V
such that G-F is a forest. The feedback vertex set problem asks for a feedback
vertex set of minimal cardinality. We show that the feedback vertex set problem
can be solved in polynomial time on chordal bipartite graphs
On Adaptive Algorithms for Maximum Matching
In the fundamental Maximum Matching problem the task is to find a maximum cardinality set of pairwise disjoint edges in a given undirected graph. The fastest algorithm for this problem, due to Micali and Vazirani, runs in time O(sqrt{n}m) and stands unbeaten since 1980. It is complemented by faster, often linear-time, algorithms for various special graph classes. Moreover, there are fast parameterized algorithms, e.g., time O(km log n) relative to tree-width k, which outperform O(sqrt{n}m) when the parameter is sufficiently small.
We show that the Micali-Vazirani algorithm, and in fact any algorithm following the phase framework of Hopcroft and Karp, is adaptive to beneficial input structure. We exhibit several graph classes for which such algorithms run in linear time O(n+m). More strongly, we show that they run in time O(sqrt{k}m) for graphs that are k vertex deletions away from any of several such classes, without explicitly computing an optimal or approximate deletion set; before, most such bounds were at least Omega(km). Thus, any phase-based matching algorithm with linear-time phases obliviously interpolates between linear time for k=O(1) and the worst case of O(sqrt{n}m) when k=Theta(n). We complement our findings by proving that the phase framework by itself still allows Omega(sqrt{n}) phases, and hence time Omega(sqrt{n}m), even on paths, cographs, and bipartite chain graphs
A tabu search heuristic based on k-diamonds for the weighted feedback vertex set problem
Given an undirected and vertex weighted graph G = (V,E,w), the Weighted Feedback Vertex Problem (WFVP) consists of finding a subset F â V of vertices of minimum weight such that each cycle in G contains at least one vertex in F. The WFVP on general graphs is known to be NP-hard and to be polynomially solvable on some special classes of graphs (e.g., interval graphs, co-comparability graphs, diamond graphs). In this paper we introduce an extension of diamond graphs, namely the k-diamond graphs, and give a dynamic programming algorithm to solve WFVP in linear time on this class of graphs. Other than solving an open question, this algorithm allows an efficient exploration of a neighborhood structure that can be defined by using such a class of graphs. We used this neighborhood structure inside our Iterated Tabu Search heuristic. Our extensive experimental show the effectiveness of this heuristic in improving the solution provided by a 2-approximate algorithm for the WFVPon general graphs
Upper clique transversals in graphs
A clique transversal in a graph is a set of vertices intersecting all maximal
cliques. The problem of determining the minimum size of a clique transversal
has received considerable attention in the literature. In this paper, we
initiate the study of the "upper" variant of this parameter, the upper clique
transversal number, defined as the maximum size of a minimal clique
transversal. We investigate this parameter from the algorithmic and complexity
points of view, with a focus on various graph classes. We show that the
corresponding decision problem is NP-complete in the classes of chordal graphs,
chordal bipartite graphs, and line graphs of bipartite graphs, but solvable in
linear time in the classes of split graphs and proper interval graphs.Comment: Full version of a WG 2023 pape
Proceedings of the 1st International Conference on Algebras, Graphs and Ordered Sets (ALGOS 2020)
International audienceOriginating in arithmetics and logic, the theory of ordered sets is now a field of combinatorics that is intimately linked to graph theory, universal algebra and multiple-valued logic, and that has a wide range of classical applications such as formal calculus, classification, decision aid and social choice.This international conference âAlgebras, graphs and ordered setâ (ALGOS) brings together specialists in the theory of graphs, relational structures and ordered sets, topics that are omnipresent in artificial intelligence and in knowledge discovery, and with concrete applications in biomedical sciences, security, social networks and e-learning systems. One of the goals of this event is to provide a common ground for mathematicians and computer scientists to meet, to present their latest results, and to discuss original applications in related scientific fields. On this basis, we hope for fruitful exchanges that can motivate multidisciplinary projects.The first edition of ALgebras, Graphs and Ordered Sets (ALGOS 2020) has a particular motivation, namely, an opportunity to honour Maurice Pouzet on his 75th birthday! For this reason, we have particularly welcomed submissions in areas related to Mauriceâs many scientific interests:⢠Lattices and ordered sets⢠Combinatorics and graph theory⢠Set theory and theory of relations⢠Universal algebra and multiple valued logic⢠Applications: formal calculus, knowledge discovery, biomedical sciences, decision aid and social choice, security, social networks, web semantics..
-matchings Parameterized by Treewidth
A \emph{matching} is a subset of edges in a graph that do not share an
endpoint. A matching is a \emph{-matching} if the subgraph of
induced by the endpoints of the edges of satisfies property
. For example, if the property is that of being a
matching, being acyclic, or being disconnected, then we obtain an \emph{induced
matching}, an \emph{acyclic matching}, and a \emph{disconnected matching},
respectively. In this paper, we analyze the problems of the computation of
these matchings from the viewpoint of Parameterized Complexity with respect to
the parameter \emph{treewidth}.Comment: To Appear in the proceedings of WG 202