Pair-sharing over rational trees
From MaRDI portal
Publication:4520179
DOI10.1016/S0743-1066(00)00009-1zbMATH Open0964.68017OpenAlexW1970730703MaRDI QIDQ4520179FDOQ4520179
Authors: Andy King 
Publication date: 12 December 2000
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0743-1066(00)00009-1
Recommendations
- Paired-domination of trees
- Paired domination in trees
- On Rational Trees
- scientific article; zbMATH DE number 3570368
- Trees with large paired-domination number
- Pairs of trees in tree--tree triangulations
- Generalizing Kruskal's theorem to pairs of cohabitating trees
- scientific article; zbMATH DE number 5054162
- Total and paired-domination numbers of a tree
- Publication:4206740
Cited In (10)
- On the interaction between sharing and linearity
- Lazy Set-Sharing Analysis
- Optimal multibinding unification for sharing and linearity analysis
- Static Analysis
- An algebraic approach to sharing analysis of logic programs
- Set-sharing is redundant for pair-sharing
- A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages
- Title not available (Why is that?)
- Finite-tree analysis for constraint logic-based languages
- Optimality in goal-dependent analysis of Sharing
Uses Software
This page was built for publication: Pair-sharing over rational trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4520179)
