On the public citation graph

The tree Constraint

https://doi.org/10.1007/11493853_7
0 signed · 47 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/3-540-45349-0_6openalex-snapshot
Global Constraints as Graph Properties on a Structured Network of Elementary Constraints of the Same Type
inferredcites →https://doi.org/10.1007/3-540-60692-0_39openalex-snapshot
Efficient algorithms for vertex arboricity of planar graphs
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_47openalex-snapshot
Cost-Based Filtering for Shorter Path Constraints
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_63openalex-snapshot
Supertree Construction with Constraint Programming
inferredcites →https://doi.org/10.1007/b13743openalex-snapshot
Principles and practice of constraint programming - CP 2003 : 9th International Conference, CP 2003, Kinsale, Ireland, September 29 - October 3, 2003 : proceedings
inferredcites →https://doi.org/10.1016/0004-3702(78)90029-2openalex-snapshot
A language and a program for stating and solving combinatorial problems
inferredcites →https://doi.org/10.1016/0895-7177(94)90127-9openalex-snapshot
Introducing global constraints in CHIP
inferredcites →https://doi.org/10.1016/s0196-6774(03)00050-6openalex-snapshot
An efficient graph algorithm for dominance constraints
inferredcites →https://doi.org/10.1016/s0304-3975(97)00254-5openalex-snapshot
Efficient algorithms for acyclic colorings of graphs
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470612309.ch10openalex-snapshot
Symmetry Breaking in Subgraph Pattern Matching
inferred← citeshttps://doi.org/10.1002/9781118604304.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/11564751_10openalex-snapshot
Graph Invariants as Necessary Conditions for Global Constraints
inferred← citeshttps://doi.org/10.1007/11564751_18openalex-snapshot
CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
inferred← citeshttps://doi.org/10.1007/11757375_5openalex-snapshot
Undirected Forest Constraints
inferred← citeshttps://doi.org/10.1007/11889205_13openalex-snapshot
The Minimum Spanning Tree Constraint
inferred← citeshttps://doi.org/10.1007/978-1-4419-1644-0_3openalex-snapshot
Global Constraints: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-030-19212-9_12openalex-snapshot
Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-44953-1_13openalex-snapshot
A Bounded Path Propagator on Directed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-59776-8_14openalex-snapshot
Counting Weighted Spanning Trees to Solve Constrained Minimum Spanning Tree Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-59776-8_15openalex-snapshot
The Weighted Arborescence Constraint
inferred← citeshttps://doi.org/10.1007/978-3-540-68155-7_19openalex-snapshot
Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint
inferred← citeshttps://doi.org/10.1007/978-3-540-72397-4_11openalex-snapshot
Necessary Condition for Path Partitioning Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-72397-4_5openalex-snapshot
The “Not-Too-Heavy Spanning Tree” Constraint
inferred← citeshttps://doi.org/10.1007/978-3-540-89812-2_6openalex-snapshot
Combining Two Structured Domains for Modeling Various Graph Matching Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-17458-2_14openalex-snapshot
Finding Strong Bridges and Strong Articulation Points in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_22openalex-snapshot
Revisiting the tree Constraint
inferred← citeshttps://doi.org/10.1007/978-3-642-30850-5_18openalex-snapshot
Computing Strong Articulation Points and Strong Bridges in Large Scale Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_16openalex-snapshot
Counting Spanning Trees to Guide Search in Constrained Spanning Tree Problems
inferred← citeshttps://doi.org/10.1007/s00453-015-9991-zopenalex-snapshot
Strong Articulation Points and Strong Bridges in Large Scale Graphs
inferred← citeshttps://doi.org/10.1007/s10479-008-0374-6openalex-snapshot
Undirected forest constraints
inferred← citeshttps://doi.org/10.1007/s10601-006-9010-8openalex-snapshot
Global Constraint Catalogue: Past, Present and Future
inferred← citeshttps://doi.org/10.1007/s10601-007-9040-xopenalex-snapshot
Combining Tree Partitioning, Precedence, and Incomparability Constraints
inferred← citeshttps://doi.org/10.1007/s10601-012-9119-xopenalex-snapshot
Improved filtering for weighted circuit constraints
inferred← citeshttps://doi.org/10.1007/s10601-013-9148-0openalex-snapshot
Explaining circuit propagation
inferred← citeshttps://doi.org/10.1016/j.dam.2015.10.001openalex-snapshot
On computing the 2-vertex-connected components of directed graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.11.011openalex-snapshot
Finding strong bridges and strong articulation points in linear time
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80029-5openalex-snapshot
Constraint Applications in Networks
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1137/1.9781611975321.3openalex-snapshot
Image Constrained Blockmodelling: A Constraint Programming Approach
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8130openalex-snapshot
Polynomially Decomposable Global Cost Functions in Weighted Constraint Satisfaction
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10435openalex-snapshot
Steiner Tree Problems with Side Constraints Using Constraint Programming
inferred← citeshttps://doi.org/10.4230/lipics.cp.2023.26openalex-snapshot
Guiding Backtrack Search by Tracking Variables During Constraint Propagation
inferred← citeshttps://doi.org/10.70675/83632d01z9a8dz4eb6za553z26be8a62bc00openalex-snapshot
Acquiring maps of interrelated invariants for combinatorial objects with an application for the synthesis of filtering algorithms
inferred← citeshttps://doi.org/10.70675/b2bd12bdz0c54z4b14z9450zd529241890caopenalex-snapshot
Estimer le nombre de solutions sur les contraintes de cardinalité
inferred← citeshttps://doi.org/10.7155/jgaa.00397openalex-snapshot
Propagation Rules for Graph Partitioning 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.