On the public citation graph

Generating Colored Trees

https://doi.org/10.1007/11604686_22
0 signed · 46 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.1006/jagm.1997.0898openalex-snapshot
Isomorph-Free Exhaustive Generation
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-48224-5_36openalex-snapshot
Efficient Generation of Plane Triangulations without Repetitions
inferredcites →https://doi.org/10.1007/978-3-319-44543-4openalex-snapshot
On Maximal Chain Subgraphs and Covers of Bipartite Graphs.
inferredcites →https://doi.org/10.1007/978-3-540-30559-0_3openalex-snapshot
Constant Time Generation of Trees with Specified Diameter
inferredcites →https://doi.org/10.1007/978-3-540-39644-4_6openalex-snapshot
Discovering Frequent Substructures in Large Unordered Trees
inferredcites →https://doi.org/10.1016/s0020-0190(02)00240-5openalex-snapshot
Efficient generation of plane trees
inferredcites →https://doi.org/10.1016/s0167-5060(08)70325-xopenalex-snapshot
Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
inferredcites →https://doi.org/10.1017/cbo9780511569913openalex-snapshot
Efficient Algorithms for Listing Combinatorial Structures
inferredcites →https://doi.org/10.1137/0209055openalex-snapshot
Constant Time Generation of Rooted Trees
inferredcites →https://doi.org/10.1137/0215039openalex-snapshot
Constant Time Generation of Free Trees
inferredcites →https://doi.org/10.1137/1.9781611970166openalex-snapshot
Combinatorial Algorithms
inferredcites →https://doi.org/10.1145/237477.237523openalex-snapshot
Foundations of computer science
inferredcites →https://doi.org/10.1145/309739.309744openalex-snapshot
Combinatorial algorithms
inferredcites →https://doi.org/10.1201/b12336-12openalex-snapshot
Introduction to Graph Theory
inferredcites →https://doi.org/10.5555/1227174.1227182openalex-snapshot
Frequent Subtree Mining - An Overview
inferredcites →https://doi.org/10.5555/338219.338260openalex-snapshot
A fast algorithm to generate unlabeled necklaces

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-59901-0_2openalex-snapshot
A Polynomial Delay Algorithm for Enumerating 2-Edge-Connected Induced Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_52openalex-snapshot
An Efficient Algorithm for Generating Colored Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-00202-1_13openalex-snapshot
Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-13073-1_6openalex-snapshot
Enumerating Rooted Graphs with Reflectional Block Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-13136-3_18openalex-snapshot
Balanced Multi-process Parallel Algorithm for Chemical Compound Inference with Given Path Frequencies
inferred← citeshttps://doi.org/10.1007/978-3-642-14553-7_13openalex-snapshot
Constant Time Generation of Biconnected Rooted Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_18openalex-snapshot
Generating Trees on Multisets
inferred← citeshttps://doi.org/10.1007/s10822-016-9916-1openalex-snapshot
Ring system-based chemical graph generation for de novo molecular design
inferred← citeshttps://doi.org/10.1016/j.dam.2020.03.034openalex-snapshot
Algorithmic enumeration of surrounding polygons
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.01.017openalex-snapshot
Efficient enumeration of ordered trees with k leaves
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115434openalex-snapshot
Reconfiguration and enumeration of optimal cyclic ladder lotteries
inferred← citeshttps://doi.org/10.1021/ci700385aopenalex-snapshot
Enumerating Treelike Chemical Graphs with Given Path Frequency
inferred← citeshttps://doi.org/10.1021/ci900447zopenalex-snapshot
Branch-and-Bound Algorithms for Enumerating Treelike Chemical Graphs with Given Path Frequency Using Detachment-Cut
inferred← citeshttps://doi.org/10.1049/cp.2015.0611openalex-snapshot
A method for generating colorings over graph automorphism
inferred← citeshttps://doi.org/10.1080/00207160701294392openalex-snapshot
Distribution of distinguishable objects to bins: generating all distributions
inferred← citeshttps://doi.org/10.1109/icict.2007.375337openalex-snapshot
Efficient Generation of Evolutionary Trees
inferred← citeshttps://doi.org/10.1109/tcbb.2016.2628888openalex-snapshot
Enumerating Substituted Benzene Isomers of Tree-Like Chemical Graphs
inferred← citeshttps://doi.org/10.1109/tcbb.2018.2832061openalex-snapshot
Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs
inferred← citeshttps://doi.org/10.1142/s0219720013430075openalex-snapshot
BREADTH-FIRST SEARCH APPROACH TO ENUMERATION OF TREE-LIKE CHEMICAL COMPOUNDS
inferred← citeshttps://doi.org/10.1145/3180382.3180384openalex-snapshot
Enumerating Chemical Mono-Block 3-Augmented Trees with Two Junctions
inferred← citeshttps://doi.org/10.1186/1471-2105-12-s14-s3openalex-snapshot
Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies
inferred← citeshttps://doi.org/10.1186/1758-2946-6-31openalex-snapshot
Efficient enumeration of monocyclic chemical graphs with given path frequencies
inferred← citeshttps://doi.org/10.1587/transfun.2022dmp0007openalex-snapshot
Enumerating Empty and Surrounding Polygons
inferred← citeshttps://doi.org/10.1587/transinf.2021fcp0005openalex-snapshot
A Polynomial Delay Algorithm for Enumerating 2-Edge-Connected Induced Subgraphs
inferred← citeshttps://doi.org/10.1587/transinf.e94.d.1846openalex-snapshot
Kernel Methods for Chemical Compounds: From Classification to Design
inferred← citeshttps://doi.org/10.3390/math13213405openalex-snapshot
Counting Tree-like Multigraphs with a Given Number of Vertices and Multiple Edges
inferred← citeshttps://doi.org/10.48550/arxiv.2004.06367openalex-snapshot
Enumerating Chemical Graphs with Mono-block 2-Augmented Tree Structure from Given Upper and Lower Bounds on Path Frequencies
inferred← citeshttps://doi.org/10.48550/arxiv.2004.08381openalex-snapshot
Enumerating Chemical Graphs with Two Disjoint Cycles Satisfying Given Path Frequency Specifications
inferred← citeshttps://doi.org/10.5936/csbj.201302004openalex-snapshot
COMPARISON AND ENUMERATION OF CHEMICAL GRAPHS
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.