Rank Reduction of Oriented Graphs by Vertex and Edge Deletions

Meesum, Syed Mohammad; Saurabh, Saket

doi:10.1007/s00453-017-0340-2

Search citation statements

Order By: Relevance

Paper Sections

Select...

Subexponential Time Algorithms1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2020

2023

Publication Types

Select...

Other1

Article1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Using the H-Bag Editing problem from Damaschke and Mogren [85], Meesum, Misra, and Saurabh [220] show that the r-Rank Reduction Editing problem is solvable in time (1) . In this problem, we are asked to edit the input graph G to a graph G by modifying at most k edges so that rank(A G ), the rank of the adjacency matrix of G is at most r. A similar result is shown in [221] for the directed case.…”

Section: Subexponential Time Algorithmsmentioning

confidence: 74%

A survey of parameterized algorithms and the complexity of edge modification

Crespelle¹,

Drange²,

Fomin³

et al. 2020

Preprint

View full text Add to dashboard Cite

The survey provides an overview of the developing area of parameterized algorithms for graph modification problems. We concentrate on edge modification problems, where the task is to change a small number of adjacencies in a graph in order to satisfy some required property. IMPORTANT NOTICE:This survey is still in a tentative version. If you find some mistakes or missing results, please contact us as soon as possible so that we can correct before final publication.

show abstract