A Branch-And-Cut Algorithm for the Maximum K-Balanced Subgraph of a Signed Graph

Discrete Applied Mathematics - Netherlands
doi 10.1016/j.dam.2018.11.022
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

A Branch-And-Cut Algorithm for Partition Coloring

Networks
Information SystemsComputer NetworksHardwareCommunicationsArchitectureSoftware
2009English

A Parallel McMc Algorithm for the Balanced Graph Coloring Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Approximate Max K-Cut With Subgraph Guarantee

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
1998English

A Parallel Branch and Bound Algorithm for the Maximum Labelled Clique Problem

Optimization Letters
ControlOptimization
2014English

Vertex Decompositions of Sparse Graphs Into an Edgeless Subgraph and a Subgraph of Maximum Degree at Most K

Journal of Graph Theory
GeometryTopology
2009English

A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations

English

LayoutShow: A Signed Applet/Application for Graph Drawing and Experimentation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Pertubations in a Signed Graph and Its Index

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

A Note on a Matrix Criterion for Unique Colorability of a Signed Graph

Psychometrika
Applied MathematicsPsychology
1967English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy