Rank Reduction of Oriented Graphs by Vertex and Edge Deletions
Sign Up to like & getrecommendations! Published in 2017 at "Algorithmica"
DOI: 10.1007/s00453-017-0340-2
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… read more here.
Keywords: adjacency matrix; edge; deletion; oriented graphs ... See more keywords