On making directed graphs transitive
type: Item
instance of: scholarly article
title: On making directed graphs transitive
zbMATH Open document ID: 1280.68104
author: Mathias Weller
author: Christian Komusiewicz
author: Rolf Niedermeier
author: Johannes Uhlmann
published in: Journal of Computer and System Sciences
publication date: 2012-05-11T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 6033510
zbMATH Keywords: graph modification problem
zbMATH Keywords: NP-hardness
zbMATH Keywords: hierarchical structure detection
zbMATH Keywords: fixed-parameter tractability
zbMATH Keywords: kernelization and data reduction
MaRDI profile type: Publication
full work available at URL: j.jcss.2011.07.001
OpenAlex ID: W1968950817
cites work: Digraphs
cites work: A Golden Ratio Parameterized Algorithm for Cluster Editing
cites work: Exact algorithms for cluster editing: Evaluation and experiments
cites work: Even faster parameterized cluster deletion and cluster editing
cites work: Kernelization: New Upper and Lower Bound Techniques
cites work: A \(2k\) kernel for the cluster editing problem
cites work: Exploiting Bounded Signal Flow for Graph Orientation Based on Cause–Effect Pairs
cites work: Q4393480
cites work: Efficient Parameterized Preprocessing for Cluster Editing
cites work: Parametrized complexity theory.
cites work: The directed subgraph homeomorphism problem
cites work: Automated generation of search tree algorithms for hard graphs modification problems
cites work: Graph-modeled data clustering: Exact algorithms for clique generation
cites work: A more effective linear kernelization for cluster editing
cites work: Fixed-parameter algorithms for cluster vertex deletion
cites work: Which problems have strongly exponential complexity?
cites work: Alternative Parameterizations for Cluster Editing
cites work: NP-hard problems in hierarchical-tree clustering
cites work: Efficient determination of the transitive closure of a directed graph
cites work: Q5710169
cites work: A general method to speed up fixed-parameter-tractable algorithms
cites work: Applying modular decomposition to parameterized cluster editing problems
cites work: The complexity of satisfiability problems
cites work: Cluster graph modification problems
cites work: Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
DOI: 10.1016/J.JCSS.2011.07.001
description: scientific article; zbMATH DE number 6033510