Computational aspects of the Mobius transformation of graphs
From MaRDI portal
Publication:4014208
DOI10.1109/21.148425zbMath0791.68156OpenAlexW2116816533MaRDI QIDQ4014208
Publication date: 6 October 1992
Published in: IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/21.148425
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Knowledge representation (68T30)
Related Items (19)
Focal points and their implications for Möbius transforms and Dempster-Shafer theory ⋮ Fast Algorithms for Join Operations on Tree Decompositions ⋮ Fast Möbius inversion in semimodular lattices and ER-labelable posets ⋮ Theory of evidence ? A survey of its mathematical foundations, applications and computational aspects ⋮ Evaluation of permanents in rings and semirings ⋮ The application of the matrix calculus to belief functions. ⋮ Approximating the combination of belief functions using the fast Möbius transform in a coarsened frame. ⋮ Covering and packing in linear space ⋮ Constructing and evaluating alternative frames of discernment ⋮ Faster algorithms for finding and counting subgraphs ⋮ Fast monotone summation over disjoint sets ⋮ Efficient Möbius Transformations and Their Applications to D-S Theory ⋮ Clustering decomposed belief functions using generalized weights of conflict ⋮ Estimating limits from Poisson counting data using Dempster-Shafer analysis ⋮ Incremental conditioning of lower and upper probabilities ⋮ Unnamed Item ⋮ Cancellation-free circuits in unbounded and bounded depth ⋮ Dealing with external actions in belief causal networks ⋮ A generic convolution algorithm for join operations on tree decompositions
This page was built for publication: Computational aspects of the Mobius transformation of graphs
