Graph Bipartization and via minimization
From MaRDI portal
Recommendations
Cited in
(36)- Conditional matching preclusion for hypercube-like interconnection networks
- Crossing minimization in weighted bipartite graphs
- A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis
- Negative (and positive) circles in signed graphs: a problem collection
- New bounds for the signless Laplacian spread
- The critical node detection problem in networks: a survey
- An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
- Faster graph bipartization
- Polyhedral results for the bipartite induced subgraph problem
- On the computational complexity of the bipartizing matching problem
- Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs
- On bipartization of cubic graphs by removal of an independent set
- Very cost effective bipartitions in graphs
- A minimal surface criterion for graph partitioning
- A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem
- Algorithm Engineering for Optimal Graph Bipartization
- scientific article; zbMATH DE number 3985121 (Why is no real title available?)
- Problème de la bipartition minimale d'un graphe
- Solving VLSI design and DNA sequencing problems using bipartization of graphs
- Applications of the Dulmage--Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement
- Distance in stratified graphs
- Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs
- Inductive graph invariants and approximation algorithms
- An Updated Experimental Evaluation of Graph Bipartization Methods
- Crossing Minimization in Weighted Bipartite Graphs
- scientific article; zbMATH DE number 5237020 (Why is no real title available?)
- Experimental and Efficient Algorithms
- Minimization and parameterized variants of vertex partition problems on graphs
- Graph Bipartization Problem with Applications to Via Minimization in VLSI Design
- Strong matching preclusion
- Maximum bipartite subgraphs of geometric intersection graphs
- The maximum k-colorable subgraph problem and orbitopes
- The maximum independent set problem on circulant graphs C_n ( a, b )
- Bipartizing (pseudo-)disk graphs: approximation with a ratio better than 3
- An exact combinatorial algorithm for minimum graph bisection
- Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph
This page was built for publication: Graph Bipartization and via minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3833614)
