Open AccessOn the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs
Author(s) -
Vahan Mkrtchyan,
Garik Petrosyan
Publication year - 2022
Publication title -
journal of graph algorithms and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.387
H-Index - 38
ISSN - 1526-1719
DOI - 10.7155/jgaa.00584
Subject(s) - bipartite graph , vertex cover , combinatorics , edge cover , vertex (graph theory) , matching (statistics) , mathematics , enhanced data rates for gsm evolution , cover (algebra) , constraint (computer aided design) , computer science , graph , artificial intelligence , geometry , statistics , mechanical engineering , engineering
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom