Linear-time minimal cograph editing (Q2140496)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Linear-time minimal cograph editing	scientific article

Statements

scholarly article

0 references

Linear-time minimal cograph editing (English)

0 references

Christophe Crespelle

0 references

publication date

20 May 2022

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-86593-1_12

0 references

Complexity of Finding Embeddings in a <i>k</i>-Tree

0 references

Subexponential parameterized algorithm for Interval Completion

0 references

Cluster Editing

0 references

Exact algorithms for cluster editing: Evaluation and experiments

0 references

Fast Quasi-Threshold Editing

0 references

Unit interval editing is fixed-parameter tractable

0 references

Complement reducible graphs

0 references

A Linear Recognition Algorithm for Cographs

0 references

Fully dynamic recognition algorithm and certificate for directed cographs

0 references

Faster and enhanced inclusion-minimal cograph completion

0 references

An \(O(n^2)\) time algorithm for the minimal permutation completion problem

0 references

An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem

0 references

On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems

0 references

Minimal comparability completions of arbitrary graphs

0 references

Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)

0 references

Minimal split completions

0 references

Cograph editing: Merging modules is equivalent to editing P_4s

0 references

Defining and identifying cograph communities in complex networks

0 references

Mapping the genome

0 references

Complexity and parameterized algorithms for cograph editing

0 references

Characterizing and computing minimal cograph completions

0 references

BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES

0 references

On minimal augmentation of a graph to obtain an interval graph

0 references

Minimal proper interval completions

0 references

Identifiers

10.1007/978-3-030-86593-1_12

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2140496

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2140496&oldid=36807421"