NDLI: A Binding Number Computation of Graph

Content Provider	IEEE Xplore Digital Library
Author	Congying Han Guoping He Hua Duan Xuping Zhang
Copyright Year	2008
Description	Author affiliation: Dept. of Math., Shanghai Jiaotong Univ., Shanghai (Congying Han)
Abstract	Graph-based binding algorithm is very popular for a retargetable compiler in computer science. Binding number, one indicator to better understand graph, is an important characteristic quantity of graph. Constant work have been done on binding number computation by many researchers for some special graphs, such as product graphs, multi-product graphs, multiple cartesian product graph of complete bipartite graph. This paper is meant to present a polynomial algorithm of the generality graph binding number through the maximum network flow algorithm. We convert binding number computation into calculating the capacity of a minimum cut by constructing directed network with some parameters based on the transformation idea from the least ratio to the least difference. In the latter part,the time complexity of the polynomial algorithm is analyzed and given.
Starting Page	285
Ending Page	288
File Size	159553
Page Count	4
File Format	PDF
ISBN	9780769533056
DOI	10.1109/FSKD.2008.210
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-10-18
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Computer science Algorithm design and analysis Information science Educational institutions Polynomials Mathematics Computer networks Bipartite graph Fuzzy systems
Content Type	Text
Resource Type	Article

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

Computer Strategies for Solitaire Yahtzee

Mathpad: A Fuzzy Logic-Based Recognition System for Handwritten Mathematics

Market equilibrium via a primal-dual-type algorithm

A 5k kernel for P2-packing in net-free graphs

Ordering Bipartite Graphs by their Minimal Energies

GCD computation of n integers

Unbiased Sampling of Bipartite Graph

A New Similarity Measure for the Anomaly Intrusion Detection

Ordering fuzzy sets generated by a neural network algorithm

A Binding Number Computation of Graph

Similar Documents

Computer Strategies for Solitaire Yahtzee

Mathpad: A Fuzzy Logic-Based Recognition System for Handwritten Mathematics

Market equilibrium via a primal-dual-type algorithm

A 5k kernel for P2-packing in net-free graphs

Ordering Bipartite Graphs by their Minimal Energies

GCD computation of n integers

Unbiased Sampling of Bipartite Graph

A New Similarity Measure for the Anomaly Intrusion Detection

Ordering fuzzy sets generated by a neural network algorithm

A Binding Number Computation of Graph