A fixed-parameter tractable algorithm for matrix domination (Q2390264): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Vertex Cover: Further Observations and Further Improvements / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4393480 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4850549 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4263467 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4941917 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4130999 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Edge Dominating Sets in Graphs / rank | |||
Normal rank |
Latest revision as of 20:01, 1 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A fixed-parameter tractable algorithm for matrix domination |
scientific article |
Statements
A fixed-parameter tractable algorithm for matrix domination (English)
0 references
21 July 2009
0 references
computational complexity
0 references
parameterized complexity
0 references
graph algorithms
0 references
analysis of algorithms
0 references