scientific article; zbMATH DE number 6273782
From MaRDI portal
Publication:5403059
zbMath1283.68164MaRDI QIDQ5403059
Eva Jelínková, Ondřej Suchý, Jan Kratochvíl, Petr Hliněný
Publication date: 25 March 2014
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1531/0.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity, Subgraph complementation, Speeding up Graph Algorithms via Switching Classes, A survey of parameterized algorithms and the complexity of edge modification, Partial complementation of graphs
