On the public citation graph

A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically

https://doi.org/10.1007/bf02277184
0 signed · 48 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.1007/bf02248731openalex-snapshot
Clique detection for nondirected graphs: Two new algorithms
inferredcites →https://doi.org/10.1007/bf02760024openalex-snapshot
On cliques in graphs
inferredcites →https://doi.org/10.1016/0022-247x(69)90233-9openalex-snapshot
Maximum internally stable sets of a graph
inferredcites →https://doi.org/10.1137/0126009openalex-snapshot
Clique Detection Algorithms Based on Line Addition and Line Removal
inferredcites →https://doi.org/10.1137/0202001openalex-snapshot
The Enumeration of Maximal Cliques of Large Graphs
inferredcites →https://doi.org/10.1137/0206036openalex-snapshot
A New Algorithm for Generating All the Maximal Independent Sets
inferredcites →https://doi.org/10.1137/0209042openalex-snapshot
Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
inferredcites →https://doi.org/10.1145/321607.321608openalex-snapshot
An Analysis of Some Graph Theoretical Cluster Techniques
inferredcites →https://doi.org/10.1145/321694.321698openalex-snapshot
Corrections to Bierstone's Algorithm for Generating Cliques
inferredcites →https://doi.org/10.1145/362342.362367openalex-snapshot
Algorithm 457: finding all cliques of an undirected graph
inferredcites →https://doi.org/10.2307/2785673openalex-snapshot
A Procedure for Clique Detection Using the Group Matrix

What points at this work

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

inferred← citeshttps://doi.org/10.1002/jcc.540050105openalex-snapshot
A combinatorial algorithm for calculating ligand binding
inferred← citeshttps://doi.org/10.1002/jmr.300080503openalex-snapshot
Searching for pharmacophoric patterns in databases of three‐dimensional chemical structures
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_634openalex-snapshot
Stable Set Problem: Branch & Cut Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4614-0857-4_5openalex-snapshot
Clique Relaxation Models in Social Network Analysis
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_634-1openalex-snapshot
Stable Set Problem: Branch & Cut Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-67428-5_13openalex-snapshot
Listing Maximal Independent Sets with Minimal Space and Bounded Delay
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_36openalex-snapshot
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
inferred← citeshttps://doi.org/10.1007/978-3-642-20841-6_29openalex-snapshot
Mining Maximal Co-located Event Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-38527-8_11openalex-snapshot
Efficient Counting of Maximal Independent Sets in Sparse Graphs
inferred← citeshttps://doi.org/10.1007/bf00141572openalex-snapshot
FOUNDATION: A program to retrieve all possible structures containing a user-defined minimum number of matching query elements from three-dimensional databases
inferred← citeshttps://doi.org/10.1007/bf01098364openalex-snapshot
The maximum clique problem
inferred← citeshttps://doi.org/10.1007/s00778-006-0019-9openalex-snapshot
Efficient algorithms for mining maximal valid groups
inferred← citeshttps://doi.org/10.1016/0165-4896(83)90047-1openalex-snapshot
Two algorithms for generating and ranking the family of solutions of a finite irreflexive relation
inferred← citeshttps://doi.org/10.1016/0898-1221(83)90115-3openalex-snapshot
A new backtracking algorithm for generating the family of maximal independent sets of a graph
inferred← citeshttps://doi.org/10.1016/j.csi.2018.07.004openalex-snapshot
An energy-efficient, self-stabilizing and distributed algorithm for maximal independent set construction in wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.dam.2011.10.024openalex-snapshot
Maximal independent sets in caterpillar graphs
inferred← citeshttps://doi.org/10.1016/j.eswa.2014.07.027openalex-snapshot
Solving the winner determination problem via a weighted maximum clique heuristic
inferred← citeshttps://doi.org/10.1016/j.jpdc.2009.01.003openalex-snapshot
A scalable, parallel algorithm for maximal clique enumeration
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.03.011openalex-snapshot
Theoretical underpinnings for maximal clique enumeration on perturbed graphs
inferred← citeshttps://doi.org/10.1021/ci00056a002openalex-snapshot
Algorithms for the identification of three-dimensional maximal common substructures
inferred← citeshttps://doi.org/10.1080/00207168308803357openalex-snapshot
An algorithm for the maximum internally stable set in a weighted graph
inferred← citeshttps://doi.org/10.1093/bioinformatics/17.6.487openalex-snapshot
Uniform integration of genome mapping data using intersection graphs
inferred← citeshttps://doi.org/10.1109/25.54230openalex-snapshot
Computational complexity of some interference graph calculations (mobile radio)
inferred← citeshttps://doi.org/10.1109/icdmw.2006.33openalex-snapshot
Association Bundle - A New Pattern for Association Analysis
inferred← citeshttps://doi.org/10.1109/jproc.2020.2977595openalex-snapshot
A Tutorial on Clique Problems in Communications and Signal Processing
inferred← citeshttps://doi.org/10.1145/1458082.1458288openalex-snapshot
Large maximal cliques enumeration in sparse graphs
inferred← citeshttps://doi.org/10.1145/2543629openalex-snapshot
Listing All Maximal Cliques in Large Sparse Real-World Graphs
inferred← citeshttps://doi.org/10.1147/jrd.2010.2081230openalex-snapshot
Discovery and analysis of tightly knit communities in telecom social networks
inferred← citeshttps://doi.org/10.11591/ijece.v7i6.pp3583-3592openalex-snapshot
CHN and Swap Heuristic to Solve the Maximum Independent Set Problem
inferred← citeshttps://doi.org/10.12677/csa.2020.109175openalex-snapshot
Solving Maximum Clique Problem Based on Adjacent Points
inferred← citeshttps://doi.org/10.32657/10356/2526openalex-snapshot
Efficient mining of group patterns for mobile users
inferred← citeshttps://doi.org/10.32920/ryerson.14655771openalex-snapshot
Clique Listing Algorithms and Characteristics of Cliques in Random Graphics
inferred← citeshttps://doi.org/10.32920/ryerson.14655771.v1openalex-snapshot
Clique Listing Algorithms and Characteristics of Cliques in Random Graphics
inferred← citeshttps://doi.org/10.4230/dagsemproc.10441.2openalex-snapshot
Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time
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.5121/ijdkp.2012.2204openalex-snapshot
Detecting Cliques Using Degree and Connectivity Constraints
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.