Pages that link to "Item:Q3833614"
From MaRDI portal
The following pages link to Graph Bipartization and via minimization (Q3833614):
Displaying 33 items.
- On bipartization of cubic graphs by removal of an independent set (Q298966) (← links)
- Very cost effective bipartitions in graphs (Q322000) (← links)
- A minimal surface criterion for graph partitioning (Q338611) (← links)
- A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem (Q342319) (← links)
- Solving VLSI design and DNA sequencing problems using bipartization of graphs (Q429453) (← links)
- Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs (Q501082) (← links)
- Strong matching preclusion (Q653338) (← links)
- The maximum \(k\)-colorable subgraph problem and orbitopes (Q666000) (← links)
- An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
- Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph (Q972337) (← links)
- Conditional matching preclusion for hypercube-like interconnection networks (Q1029332) (← links)
- Crossing minimization in weighted bipartite graphs (Q1044030) (← links)
- A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis (Q1276973) (← links)
- Negative (and positive) circles in signed graphs: a problem collection (Q1643910) (← links)
- New bounds for the signless Laplacian spread (Q1736235) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- An approximate max-flow min-cut relation for undirected multicommodity flow, with applications (Q1894701) (← links)
- Faster graph bipartization (Q2301359) (← links)
- Polyhedral results for the bipartite induced subgraph problem (Q2433802) (← links)
- On the computational complexity of the bipartizing matching problem (Q2675722) (← links)
- Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs (Q2813347) (← links)
- Algorithm Engineering for Optimal Graph Bipartization (Q3627967) (← links)
- Problème de la bipartition minimale d'un graphe (Q3765553) (← links)
- Applications of the Dulmage--Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement (Q4389077) (← links)
- Distance in stratified graphs (Q4457237) (← links)
- Inductive graph invariants and approximation algorithms (Q5101914) (← links)
- An Updated Experimental Evaluation of Graph Bipartization Methods (Q5102059) (← links)
- Crossing Minimization in Weighted Bipartite Graphs (Q5432313) (← links)
- (Q5443138) (← links)
- Experimental and Efficient Algorithms (Q5710023) (← links)
- Minimization and parameterized variants of vertex partition problems on graphs (Q6087212) (← links)
- Graph Bipartization Problem with Applications to Via Minimization in VLSI Design (Q6132388) (← links)
- Maximum bipartite subgraphs of geometric intersection graphs (Q6552516) (← links)
