{"id":"https://openalex.org/keywords/broadcast-time","display_name":"broadcast time","description":"The number of communication rounds required for a broadcast process to reach all vertices in a graph.","display_name_alternatives":["graph broadcast time"],"ids":{"openalex":"https://openalex.org/keywords/broadcast-time","wikidata":null},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4592,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4592,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.1107,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":363,"cited_by_count":4938,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/broadcast-time","updated_date":"2026-11-17T04:05:58","created_date":"2022-04-12T19:38:12"}
