Random iteration algorithm for graph-directed sets

DOI10.4230/OASICS.CCA.2009.2275MaRDI QIDQ2917349zbMATH OpenOpenAlexFDO

Authors Yoshiki Tsujii, Takakazu Mori, Mariko Yasugi, Hideki Tsuiki

Publication date 28 September 2012

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2009/2275/pdf/Tsujii.2275.pdf

zbMATH Keywords

graph-directed setsinvariant probability measuresdisplaying fractalsrandom iteration algorithms

Mathematics Subject Classification ID

Randomized algorithms (68W20) Fractals (28A80)

Recommendations

• A Sequential Algorithm for Generating Random Graphs
• A sequential algorithm for generating random graphs
• Iterative algorithms for generating minimal cutsets in directed graphs
• Random procedures for dominating sets in graphs
• Randomization for efficient dynamic graph algorithms (invited talk)
• Randomized OBDD-based graph algorithms
• Randomized OBDD-based graph algorithms
• scientific article; zbMATH DE number 1467487
• Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth
• scientific article; zbMATH DE number 1890147

Cited in

(5)

• scientific article; zbMATH DE number 1215120 (Why is no real title available?)
• On Graph Directed Constructions Of Fractals
• scientific article; zbMATH DE number 1989776 (Why is no real title available?)
• An algorithm to generate directed-graph sets with the SSC from self-similar sets
• A random direction algorithm for an intersection problem

This page was built for publication: Random iteration algorithm for graph-directed sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2917349)