On the public citation graph

A fast algorithm for the maximum weight clique problem

https://doi.org/10.1007/bf02243394
0 signed · 66 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/nav.3800240203openalex-snapshot
A node covering algorithm
inferredcites →https://doi.org/10.1007/bf01299447openalex-snapshot
An exact algorithm for the maximum stable set problem
inferredcites →https://doi.org/10.1007/bf01415983openalex-snapshot
A branch and bound algorithm for the maximum clique problem
inferredcites →https://doi.org/10.1007/bf01580444openalex-snapshot
Vertex packings: Structural properties and algorithms
inferredcites →https://doi.org/10.1007/bf02257777openalex-snapshot
Finding maximum cliques in arbitrary and in special graphs
inferredcites →https://doi.org/10.1016/0167-6377(90)90057-copenalex-snapshot
An exact algorithm for the maximum clique problem
inferredcites →https://doi.org/10.1016/0305-0548(90)90048-copenalex-snapshot
Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph
inferredcites →https://doi.org/10.1057/jors.1992.71openalex-snapshot
A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
inferredcites →https://doi.org/10.1080/00207168308803357openalex-snapshot
An algorithm for the maximum internally stable set in a weighted graph
inferredcites →https://doi.org/10.1080/00207169108803967openalex-snapshot
An algorithm for finding a maximum weighted independent set in an arbitrary graph
inferredcites →https://doi.org/10.1137/0215075openalex-snapshot
Finding a Maximum Clique in an Arbitrary Graph
inferredcites →https://doi.org/10.1137/0220012openalex-snapshot
Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
inferredcites →https://doi.org/10.1137/0221058openalex-snapshot
Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
inferredcites →https://doi.org/10.1145/359094.359101openalex-snapshot
New methods to color the vertices of a graph

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/(sici)1520-684x(199705)28:5<60::aid-scj7>3.0.co;2-mopenalex-snapshot
A simple and efficient branch and bound algorithm for finding a maximum clique with experimental evaluations
inferred← citeshttps://doi.org/10.1007/0-387-34296-6_2openalex-snapshot
The One Clause at a Time (OCAT) Approach to Data Mining and Knowledge Discovery
inferred← citeshttps://doi.org/10.1007/978-1-4614-6322-1_9openalex-snapshot
A Timeslot-Filling Heuristic Approach to Construct High-School Timetables
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_1openalex-snapshot
The Maximum Clique Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_720-1openalex-snapshot
Stochastic and Risk Averse Maximum Subgraph Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-58475-7_20openalex-snapshot
Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-50127-7_21openalex-snapshot
Local Search for Maximum Vertex Weight Clique on Large Sparse Graphs with Efficient Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-20807-2_21openalex-snapshot
Safe Lower Bounds for Graph Coloring
inferred← citeshttps://doi.org/10.1007/978-90-481-3485-4_8openalex-snapshot
Design Methods and Tools for Improved Partial Dynamic Reconfiguration
inferred← citeshttps://doi.org/10.1007/s00521-022-08086-4openalex-snapshot
A multi-view clustering algorithm for attributed weighted multi-edge directed networks
inferred← citeshttps://doi.org/10.1007/s10479-012-1124-3openalex-snapshot
Multi-neighborhood tabu search for the maximum weight clique problem
inferred← citeshttps://doi.org/10.1007/s10479-016-2212-6openalex-snapshot
Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
inferred← citeshttps://doi.org/10.1007/s10489-020-01673-9openalex-snapshot
A similarity model based on reinforcement local maximum connected same destination structure oriented to disordered fusion of knowledge graphs
inferred← citeshttps://doi.org/10.1007/s10732-007-9026-2openalex-snapshot
Approximating the maximum vertex/edge weighted clique using local search
inferred← citeshttps://doi.org/10.1007/s10878-014-9718-0openalex-snapshot
On risk-averse maximum weighted subgraph problems
inferred← citeshttps://doi.org/10.1007/s10878-016-9990-2openalex-snapshot
Solving the maximum vertex weight clique problem via binary quadratic programming
inferred← citeshttps://doi.org/10.1007/s11227-023-05841-9openalex-snapshot
Efficient computation of maximum weighted independent sets on weighted dynamic graph
inferred← citeshttps://doi.org/10.1007/s11590-017-1128-7openalex-snapshot
A hybrid iterated local search heuristic for the maximum weight independent set problem
inferred← citeshttps://doi.org/10.1007/s12532-012-0042-3openalex-snapshot
Maximum-weight stable sets and safe lower bounds for graph coloring
inferred← citeshttps://doi.org/10.1016/0305-0548(95)00075-5openalex-snapshot
On the minimum number of logical clauses inferred from examples
inferred← citeshttps://doi.org/10.1016/j.artint.2019.103230openalex-snapshot
SCCWalk: An efficient local search algorithm and its improvements for maximum weight clique problem
inferred← citeshttps://doi.org/10.1016/j.cor.2012.06.002openalex-snapshot
Breakout Local Search for maximum clique problems
inferred← citeshttps://doi.org/10.1016/j.dam.2017.01.026openalex-snapshot
Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-bound
inferred← citeshttps://doi.org/10.1016/j.disopt.2016.01.005openalex-snapshot
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.01.049openalex-snapshot
Fixed interval scheduling: Models, applications, computational complexity and algorithms
inferred← citeshttps://doi.org/10.1016/s0167-6377(98)00006-6openalex-snapshot
Cliques and clustering: A combinatorial approach
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80045-9openalex-snapshot
A New Algorithm for the Maximum-Weight Clique Problem
inferred← citeshttps://doi.org/10.1021/ci0502247openalex-snapshot
An Automated Method for Exploring Targeted Substructural Diversity within Sets of Chemical Structures
inferred← citeshttps://doi.org/10.1023/a:1023245011830openalex-snapshot
Target-Oriented Branch and Bound Method for Global Optimization
inferred← citeshttps://doi.org/10.1023/a:1026456624746openalex-snapshot
An Augmentation Algorithm for the Maximum Weighted Stable Set Problem
inferred← citeshttps://doi.org/10.1049/ell2.12685openalex-snapshot
A local search algorithm with hybrid strategies for the maximum weighted quasi‐clique problem
inferred← citeshttps://doi.org/10.1109/72.883403openalex-snapshot
Approximating the maximum weight clique using replicator dynamics
inferred← citeshttps://doi.org/10.1109/access.2018.2799953openalex-snapshot
An Efficient Local Search for the Maximum Edge Weighted Clique Problem
inferred← citeshttps://doi.org/10.1109/ipdpsw.2016.111openalex-snapshot
A Parallel Ant Colony Optimization for the Maximum-Weight Clique Problem
inferred← citeshttps://doi.org/10.1109/isda.2012.6416604openalex-snapshot
An expected value model of quadratic clique problem on a graph with fuzzy parameters
inferred← citeshttps://doi.org/10.1109/tmscs.2018.2874248openalex-snapshot
A New Fluid-Chip Co-Design for Digital Microfluidic Biochips Considering Cost Drivers and Design Convergence
inferred← citeshttps://doi.org/10.1109/tnet.2011.2111462openalex-snapshot
Practical Computation of Optimal Schedules in Multihop Wireless Networks
inferred← citeshttps://doi.org/10.1134/s1064226915120177openalex-snapshot
Combinatorial clustering: Literature review, methods, examples
inferred← citeshttps://doi.org/10.1137/1.9781611976472.10openalex-snapshot
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations
inferred← citeshttps://doi.org/10.1137/s1052623400381413openalex-snapshot
A Complementary Pivoting Approach to the Maximum Weight Clique Problem
inferred← citeshttps://doi.org/10.1145/3442381.3450130openalex-snapshot
Efficient Reductions and a Fast Algorithm of Maximum Weighted Independent Set
inferred← citeshttps://doi.org/10.1145/3583131.3590353openalex-snapshot
Finding Near-Optimal Weight Independent Sets at Scale
inferred← citeshttps://doi.org/10.1155/2016/9790629openalex-snapshot
A New Distributed Approximation Algorithm for the Maximum Weight Independent Set Problem
inferred← citeshttps://doi.org/10.14778/2350229.2350233openalex-snapshot
Diversifying top-k results
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10067openalex-snapshot
Two Efficient Local Search Algorithms for Maximum Weight Clique Problem
inferred← citeshttps://doi.org/10.25358/openscience-3232openalex-snapshot
Volumenpackungen nach SAE J1100
inferred← citeshttps://doi.org/10.48550/arxiv.2008.01961openalex-snapshot
An Algorithm Framework for the Exact Solution and Improved Approximation of the Maximum Weighted Independent Set Problem
inferred← citeshttps://doi.org/10.5019/j.ijcir.2006.72openalex-snapshot
A Hybrid Evolutionary Approach to Maximum Weight Clique Problem
inferred← citeshttps://doi.org/10.5281/zenodo.1078658openalex-snapshot
Approximating Maximum Weighted Independent Set Using Vertex Support
inferred← citeshttps://doi.org/10.5555/766502.766504openalex-snapshot
A new algorithm for the maximum-weight clique problem
inferred← citeshttps://doi.org/10.5772/13245openalex-snapshot
Efficient Algorithms for Finding Maximum and Maximal Cliques: Effective Tools for Bioinformatics
inferred← citeshttps://doi.org/10.70675/6b2d1f38za0ebz4565zbbfcza9eff0708d44openalex-snapshot
Studies on collaborative transportation planning among carriers
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.