On Making Directed Graphs Transitive (Q3183483): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 02:26, 2 July 2024

scientific article

Language	Label	Description	Also known as
English	On Making Directed Graphs Transitive	scientific article

Statements

scholarly article

0 references

On Making Directed Graphs Transitive (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-642-03367-4_47

0 references

0 references

Christian Komusiewicz

0 references

Rolf Niedermeier

0 references

Johannes Uhlmann

0 references

Lecture Notes in Computer Science

0 references

publication date

20 October 2009

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-03367-4_47

0 references

0 references

0 references

Exact Algorithms for Cluster Editing: Evaluation and Experiments

0 references

Efficient Parameterized Preprocessing for Cluster Editing

0 references

Graph-modeled data clustering: Exact algorithms for clique generation

0 references

A more effective linear kernelization for cluster editing

0 references

Fixed-parameter algorithms for cluster vertex deletion

0 references

On the complexity of bicoloring clique hypergraphs of graphs

0 references

Efficient determination of the transitive closure of a directed graph

0 references

0 references

Applying modular decomposition to parameterized cluster editing problems

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3183483

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