Local computations on triangular graphs

DOI10.3233/FI-2010-266MaRDI QIDQ3065014zbMATH OpenOpenAlexFDO

Authors Antoni Mazurkiewicz

Publication date 3 January 2011

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2010-266

zbMATH Keywords

leader electionslocal algorithmsnodes orderingsspanning treestriangular graphs

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Local properties of triangular graphs
• Characterizations of classes of graphs recognizable by local computations
• On the recognition of families of graphs with local computations
• Local computations in graphs: the case of cellular edge local computations
• scientific article; zbMATH DE number 512941

Cited in

(6)

• From local to global triangularization
• On the recognition of families of graphs with local computations
• Locally derivable graphs
• Local properties of simplicial complexes
• Static Scheduling with Load Balancing for Solving Triangular Band Linear Systems on Multicore Processors
• Local properties of triangular graphs

This page was built for publication: Local computations on triangular graphs

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