Fast Quasi-Threshold Editing (Q3452790): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 02:14, 11 July 2024

scientific article

Language	Label	Description	Also known as
English	Fast Quasi-Threshold Editing	scientific article

Statements

scholarly article

0 references

Fast Quasi-Threshold Editing (English)

0 references

0 references

0 references

0 references

Dorothea Wagner

0 references

Algorithms - ESA 2015

0 references

publication date

19 November 2015

0 references

full work available at URL

https://arxiv.org/abs/1504.07379

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

Graph Partitioning and Graph Clustering

0 references

Fast Quasi-Threshold Editing

0 references

Fixed-parameter tractability of graph modification problems for hereditary properties

0 references

Arboricity and Subgraph Listing Algorithms

0 references

A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements

0 references

On the threshold of intractability

0 references

A polynomial kernel for trivially perfect editing

0 references

Experiments on Density-Constrained Graph Clustering

0 references

Multilevel local search algorithms for modularity clustering

0 references

A Note on "The Comparability Graph of a Tree"

0 references

Quasi-threshold graphs

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-662-48350-3_22

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3452790

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