Local computations on triangular graphs

DOI10.3233/FI-2010-266zbMATH Open1215.68187OpenAlexW1660315652MaRDI QIDQ3065014FDOQ3065014

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

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

zbMATH Keywords

spanning treeslocal algorithmstriangular graphsleader electionsnodes orderings

Mathematics Subject Classification ID

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

Cited In (6)

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

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)