Inclusion-exclusion formulas from independent complexes
DOI10.1007/S00454-006-1274-7zbMATH Open1114.52017OpenAlexW1965201771MaRDI QIDQ866971FDOQ866971
Authors: D. Attali, Herbert Edelsbrunner 
Publication date: 14 February 2007
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-006-1274-7
Recommendations
- Inclusion-exclusion formulas from independent complexes
- Independence complexes and incidence graphs
- The inclusion-exclusion principle on some algebraic structures
- scientific article; zbMATH DE number 3999934
- Complexes of graphs with bounded independence number
- Complexes of graphs with bounded independence number
- Simplifying inclusion-exclusion formulas
- Simplifying Inclusion–Exclusion Formulas
- Independence polynomials of some compound graphs
- scientific article; zbMATH DE number 1513403
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial complexity of geometric structures (52C45)
Cited In (5)
- Simplifying Inclusion–Exclusion Formulas
- Separable Distance Transformation and Its Applications
- Inclusion-exclusion formulas from independent complexes
- Some Cardinal Estimations via the Inclusion-Exclusion Principle in Finite $$T_0$$ Topological Spaces
- Improved inclusion-exclusion inequalities for simplex and orthant arrangements
This page was built for publication: Inclusion-exclusion formulas from independent complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q866971)
