# Rank Reduction of Oriented Graphs by Vertex and Edge Deletions

Rank Reduction of Oriented Graphs by Vertex and Edge Deletions In this paper we continue our study of graph modification problems defined by reducing the rank of the adjacency matrix of the given graph, and extend our results from undirected graphs to modifying the rank of skew-adjacency matrix of oriented graphs. An instance of a graph modification problem takes as input a graph G and a positive integer k, and the objective is to either delete k vertices/edges or edit k edges so that the resulting graph belongs to a particular family $$\mathcal{F}$$ F of graphs. Given a fixed positive integer r, we define $$\mathcal{F}_r$$ F r as the family of oriented graphs where for each $$G\in \mathcal{F}_r$$ G ∈ F r , the rank of the skew-adjacency matrix of G is at most r. Using the family $$\mathcal{F}_r$$ F r we do algorithmic study, both in classical and parameterized complexity, of the following graph modification problems: $$r$$ r -Rank Vertex Deletion, $$r$$ r -Rank Edge Deletion. We first show that both the problems are NP-Complete. Then we show that these problems are fixed parameter tractable (FPT) by designing an algorithm with running time $$2^{\mathcal{O}(k \log r)}n^{\mathcal{O}(1)}$$ 2 O ( k log r ) n O ( 1 ) for $$r$$ r -Rank Vertex Deletion, and an algorithm for $$r$$ r -Rank Edge Deletion running in time $$2^{\mathcal{O}(f(r) \sqrt{k} \log k )}n^{\mathcal{O}(1)}$$ 2 O ( f ( r ) k log k ) n O ( 1 ) . In addition to our FPT results we design polynomial kernels for these problems. Our main structural result, which is the fulcrum of all our algorithmic results, is that for a fixed integer r the size of any “reduced graph” in $$\mathcal{F}_r$$ F r is upper bounded by $$3^r$$ 3 r . This result is of independent interest and generalizes a similar result of Kotlov and Lovász regarding reduced oriented graphs of rank r. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Algorithmica Springer Journals

# Rank Reduction of Oriented Graphs by Vertex and Edge Deletions

, Volume 80 (10) – Jul 5, 2017
20 pages

/lp/springer_journal/rank-reduction-of-oriented-graphs-by-vertex-and-edge-deletions-ALhZzs86eJ
Publisher
Springer Journals
Subject
Computer Science; Algorithm Analysis and Problem Complexity; Theory of Computation; Mathematics of Computing; Algorithms; Computer Systems Organization and Communication Networks; Data Structures, Cryptology and Information Theory
ISSN
0178-4617
eISSN
1432-0541
D.O.I.
10.1007/s00453-017-0340-2
Publisher site
See Article on Publisher Site

### Abstract

In this paper we continue our study of graph modification problems defined by reducing the rank of the adjacency matrix of the given graph, and extend our results from undirected graphs to modifying the rank of skew-adjacency matrix of oriented graphs. An instance of a graph modification problem takes as input a graph G and a positive integer k, and the objective is to either delete k vertices/edges or edit k edges so that the resulting graph belongs to a particular family $$\mathcal{F}$$ F of graphs. Given a fixed positive integer r, we define $$\mathcal{F}_r$$ F r as the family of oriented graphs where for each $$G\in \mathcal{F}_r$$ G ∈ F r , the rank of the skew-adjacency matrix of G is at most r. Using the family $$\mathcal{F}_r$$ F r we do algorithmic study, both in classical and parameterized complexity, of the following graph modification problems: $$r$$ r -Rank Vertex Deletion, $$r$$ r -Rank Edge Deletion. We first show that both the problems are NP-Complete. Then we show that these problems are fixed parameter tractable (FPT) by designing an algorithm with running time $$2^{\mathcal{O}(k \log r)}n^{\mathcal{O}(1)}$$ 2 O ( k log r ) n O ( 1 ) for $$r$$ r -Rank Vertex Deletion, and an algorithm for $$r$$ r -Rank Edge Deletion running in time $$2^{\mathcal{O}(f(r) \sqrt{k} \log k )}n^{\mathcal{O}(1)}$$ 2 O ( f ( r ) k log k ) n O ( 1 ) . In addition to our FPT results we design polynomial kernels for these problems. Our main structural result, which is the fulcrum of all our algorithmic results, is that for a fixed integer r the size of any “reduced graph” in $$\mathcal{F}_r$$ F r is upper bounded by $$3^r$$ 3 r . This result is of independent interest and generalizes a similar result of Kotlov and Lovász regarding reduced oriented graphs of rank r.

### Journal

AlgorithmicaSpringer Journals

Published: Jul 5, 2017

## You’re reading a free preview. Subscribe to read the entire article.

### DeepDyve is your personal research library

It’s your single place to instantly
that matters to you.

over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month ### Explore the DeepDyve Library ### Search Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly ### Organize Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place. ### Access Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals. ### Your journals are on DeepDyve Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more. All the latest content is available, no embargo periods. DeepDyve ### Freelancer DeepDyve ### Pro Price FREE$49/month
\$360/year

Save searches from
PubMed

Create lists to

Export lists, citations