scientific article; zbMATH DE number 26478

zbMATH Open0756.05065MaRDI QIDQ3983239FDOQ3983239

Authors: Kathie Cameron 

Publication date: 27 June 1992

Title of this publication is not available (Why is that?)

Recommendations

• On bipartite and multipartite clique problems
• On the Maximum Weight Clique Problem
• A cutting-plane approach to the edge-weighted maximal clique problem
• Maximum weighted edge biclique problem on bipartite graphs

zbMATH Keywords

complete multipartite graphstransit schedulingNP- completemaximum edge-weighted clique problem2-CNF satisfiabilityschedule synchronization problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited In (13)

• Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
• A linear programming formulation for the maximum complete multipartite subgraph problem
• On a max-min problem concerning weights of edges
• On graphs with polynomially solvable maximum-weight clique problem
• A cutting-plane approach to the edge-weighted maximal clique problem
• Maximum weighted edge biclique problem on bipartite graphs
• Title not available (Why is that?)
• A new family of facet defining inequalities for the maximum edge-weighted clique problem
• The maximum clique problem in multiple interval graphs
• The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
• An extended formulation approach to the edge-weighted maximal clique problem
• A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem
• On bipartite and multipartite clique problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3983239)