NDLI: Broadcasting on cactus graphs

Content Provider	Springer Nature Link
Author	Čevnik, Maja Žerovnik, Janez
Copyright Year	2015
Abstract	Broadcasting is the process of dissemination of a message from one vertex (called originator) to all other vertices in the graph. This task is accomplished by placing a sequence of calls between neighboring vertices, where one call requires one unit of time and each call involves exactly two vertices. Each vertex can participate in one call per one unit of time. Determination of the broadcast time of a vertex x in arbitrary graph G is NP-complete. Problem can be solved in polynomial time for trees and some subclasses of cactus graphs. In this paper broadcasting in cactus graphs is studied. An algorithm that determines broadcast time of any originator with time complexity O(n) in k-restricted cactus graph (where k is constant) is given. Furthermore, another algorithm which calculates broadcast time for all vertices in k-restricted cactus graph within the same time complexity is outlined. The algorithm also provides an optimal broadcast scheme for every vertex. As a byproduct, broadcast center of a k-restricted cactus graph is computed.
Starting Page	292
Ending Page	316
Page Count	25
File Format	PDF
ISSN	13826905
Journal	Journal of Combinatorial Optimization
Volume Number	33
Issue Number	1
e-ISSN	15732886
Language	English
Publisher	Springer US
Publisher Date	2015-09-16
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Broadcasting Cactus graph Broadcast time Broadcast scheme Broadcast center Combinatorics Convex and Discrete Geometry Mathematical Modeling and Industrial Mathematics Theory of Computation Optimization Operation Research/Decision Theory
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Control and Optimization Discrete Mathematics and Combinatorics Computational Theory and Mathematics Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On broadcasting in unicyclic graphs

Bandwidth sums of block graphs and cacti

Degree-constrained orientations of embedded graphs

Tagged Probe Interval Graphs

Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs

On judicious partitions of graphs

L(p,q)-labeling of sparse graphs

Vertex and Tree Arboricities of Graphs

Necessary Edges in k-Chordalisations of Graphs

Broadcasting on cactus graphs

Similar Documents

On broadcasting in unicyclic graphs

Bandwidth sums of block graphs and cacti

Degree-constrained orientations of embedded graphs

Tagged Probe Interval Graphs

Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs

On judicious partitions of graphs

L(p,q)-labeling of sparse graphs

Vertex and Tree Arboricities of Graphs

Necessary Edges in k-Chordalisations of Graphs

Broadcasting on cactus graphs