Reducing rank of the adjacency matrix by graph modification (Q344771): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(8 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2016.02.020 / rank
Normal rank
 
Property / author
 
Property / author: Syed M. Meesum / rank
Normal rank
 
Property / author
 
Property / author: Syed M. Meesum / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C50 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6655871 / rank
 
Normal rank
Property / zbMATH Keywords
 
graph modification
Property / zbMATH Keywords: graph modification / rank
 
Normal rank
Property / zbMATH Keywords
 
rank of adjacency matrix
Property / zbMATH Keywords: rank of adjacency matrix / rank
 
Normal rank
Property / zbMATH Keywords
 
vertex deletion
Property / zbMATH Keywords: vertex deletion / rank
 
Normal rank
Property / zbMATH Keywords
 
edge editing
Property / zbMATH Keywords: edge editing / rank
 
Normal rank
Property / zbMATH Keywords
 
fixed parameter tractable
Property / zbMATH Keywords: fixed parameter tractable / rank
 
Normal rank
Property / zbMATH Keywords
 
parameterized complexity
Property / zbMATH Keywords: parameterized complexity / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2016.02.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2287500156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness results for edge modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability of graph modification problems for hereditary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal Editing is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Deletion Is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Editing Simple Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for parameterized complexity of cluster editing with a small number of clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential Parameterized Algorithm for Minimum Fill-In / rank
 
Normal rank
Property / cites work
 
Property / cites work: A More Effective Linear Kernelization for Cluster Editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for cluster vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rank and size of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum edge biclique problem is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding odd cycle transversals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster graph modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-and edge-deletion NP-complete problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2016.02.020 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:56, 9 December 2024

scientific article
Language Label Description Also known as
English
Reducing rank of the adjacency matrix by graph modification
scientific article

    Statements

    Reducing rank of the adjacency matrix by graph modification (English)
    0 references
    0 references
    0 references
    0 references
    24 November 2016
    0 references
    graph modification
    0 references
    rank of adjacency matrix
    0 references
    vertex deletion
    0 references
    edge editing
    0 references
    fixed parameter tractable
    0 references
    parameterized complexity
    0 references

    Identifiers