OpenAlex | On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion

On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion

Work

Year: 2015

Type: article

Source: Journal of Discrete Algorithms

Authors Sounaka Mishra, Ashwin Pananjady, N. Safina Devi

Institutions Indian Institute of Technology Madras, University of California, Berkeley

Cites: 15

Cited by: 1

Related to: 10

FWCI:

Citation percentile (by year/subfield): 38.39

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze