Bipartite graph

View this topic in
In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint sets U and V such that every edge connects a vertex in U to one in V; that is, U and V are independent sets. (Wikipedia.org)






Conferences related to Bipartite graph

Back to Top

ICC 2021 - IEEE International Conference on Communications

IEEE ICC is one of the two flagship IEEE conferences in the field of communications; Montreal is to host this conference in 2021. Each annual IEEE ICC conference typically attracts approximately 1,500-2,000 attendees, and will present over 1,000 research works over its duration. As well as being an opportunity to share pioneering research ideas and developments, the conference is also an excellent networking and publicity event, giving the opportunity for businesses and clients to link together, and presenting the scope for companies to publicize themselves and their products among the leaders of communications industries from all over the world.


2020 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)

CVPR is the premier annual computer vision event comprising the main conference and several co-located workshops and short courses. With its high quality and low cost, it provides an exceptional value for students, academics and industry researchers.

  • 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)

    CVPR is the premier annual computer vision event comprising the main conference and severalco-located workshops and short courses. With its high quality and low cost, it provides anexceptional value for students, academics and industry researchers.

  • 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)

    CVPR is the premier annual computer vision event comprising the main conference and several co-located workshops and short courses. With its high quality and low cost, it provides an exceptional value for students, academics and industry researchers.

  • 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)

    CVPR is the premiere annual Computer Vision event comprising the main CVPR conferenceand 27co-located workshops and short courses. With its high quality and low cost, it provides anexceptional value for students,academics and industry.

  • 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)

    CVPR is the premiere annual Computer Vision event comprising the main CVPR conference and 27 co-located workshops and short courses. With its high quality and low cost, it provides an exceptional value for students, academics and industry.

  • 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)

    computer, vision, pattern, cvpr, machine, learning

  • 2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)

    CVPR is the premiere annual Computer Vision event comprising the main CVPR conference and 27 co-located workshops and short courses. Main conference plus 50 workshop only attendees and approximately 50 exhibitors and volunteers.

  • 2013 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)

    CVPR is the premiere annual Computer Vision event comprising the main CVPR conference and 27 co-located workshops and short courses. With its high quality and low cost, it provides an exceptional value for students, academics and industry.

  • 2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)

    Topics of interest include all aspects of computer vision and pattern recognition including motion and tracking,stereo, object recognition, object detection, color detection plus many more

  • 2011 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)

    Sensors Early and Biologically-Biologically-inspired Vision, Color and Texture, Segmentation and Grouping, Computational Photography and Video

  • 2010 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)

    Concerned with all aspects of computer vision and pattern recognition. Issues of interest include pattern, analysis, image, and video libraries, vision and graphics, motion analysis and physics-based vision.

  • 2009 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)

    Concerned with all aspects of computer vision and pattern recognition. Issues of interest include pattern, analysis, image, and video libraries, vision and graphics,motion analysis and physics-based vision.

  • 2008 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)

  • 2007 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)

  • 2006 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)

  • 2005 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)


2020 IEEE International Conference on Image Processing (ICIP)

The International Conference on Image Processing (ICIP), sponsored by the IEEE SignalProcessing Society, is the premier forum for the presentation of technological advances andresearch results in the fields of theoretical, experimental, and applied image and videoprocessing. ICIP 2020, the 27th in the series that has been held annually since 1994, bringstogether leading engineers and scientists in image and video processing from around the world.


2020 IEEE International Conference on Robotics and Automation (ICRA)

The International Conference on Robotics and Automation (ICRA) is the IEEE Robotics and Automation Society’s biggest conference and one of the leading international forums for robotics researchers to present their work.


2020 IEEE International Symposium on Circuits and Systems (ISCAS)

The International Symposium on Circuits and Systems (ISCAS) is the flagship conference of the IEEE Circuits and Systems (CAS) Society and the world’s premier networking and exchange forum for researchers in the highly active fields of theory, design and implementation of circuits and systems. ISCAS2020 focuses on the deployment of CASS knowledge towards Society Grand Challenges and highlights the strong foundation in methodology and the integration of multidisciplinary approaches which are the distinctive features of CAS contributions. The worldwide CAS community is exploiting such CASS knowledge to change the way in which devices and circuits are understood, optimized, and leveraged in a variety of systems and applications.


More Conferences

Periodicals related to Bipartite graph

Back to Top

Automatic Control, IEEE Transactions on

The theory, design and application of Control Systems. It shall encompass components, and the integration of these components, as are necessary for the construction of such systems. The word `systems' as used herein shall be interpreted to include physical, biological, organizational and other entities and combinations thereof, which can be represented through a mathematical symbolism. The Field of Interest: shall ...


Circuits and Systems for Video Technology, IEEE Transactions on

Video A/D and D/A, display technology, image analysis and processing, video signal characterization and representation, video compression techniques and signal processing, multidimensional filters and transforms, analog video signal processing, neural networks for video applications, nonlinear video signal processing, video storage and retrieval, computer vision, packet video, high-speed real-time circuits, VLSI architecture and implementation for video technology, multiprocessor systems--hardware and software-- ...


Circuits and Systems I: Regular Papers, IEEE Transactions on

Part I will now contain regular papers focusing on all matters related to fundamental theory, applications, analog and digital signal processing. Part II will report on the latest significant results across all of these topic areas.


Circuits and Systems II: Express Briefs, IEEE Transactions on

Part I will now contain regular papers focusing on all matters related to fundamental theory, applications, analog and digital signal processing. Part II will report on the latest significant results across all of these topic areas.


Communications Letters, IEEE

Covers topics in the scope of IEEE Transactions on Communications but in the form of very brief publication (maximum of 6column lengths, including all diagrams and tables.)


More Periodicals

Most published Xplore authors for Bipartite graph

Back to Top

Xplore Articles related to Bipartite graph

Back to Top

On derandomizing tests for certain polynomial identities

18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings., 2003

We extract a paradigm for derandomizing tests for polynomial identities from the recent AKS primality testing algorithm. We then discuss its possible application to other tests.


Application of an improved Hungarian algorithm in semantic WEB service discovery

2008 7th World Congress on Intelligent Control and Automation, 2008

The important step towards Web service implement is the discovery of required services. Traditional Web service uses UDDI, WSDL standards etc. Keywords based searching is used in the traditional service discovery. For needing manual intervention and lack of semantic description, the methods before have low precision rate. Semantic Web service problem can be reduced to an assignment problem. A mathematical ...


Low-Complexity Beam Selection Algorithms for Millimeter Wave Beamspace MIMO Systems

IEEE Communications Letters, None

We consider downlink multi-user multiple-input multiple-output (MIMO) systems, operating at millimeter Wave (mmWave) frequencies and equipped with a large number of antenna elements at the access point. Beamspace MIMO with beam selection offers an attractive solution for reducing the number of required radio frequency (RF) chains in such systems. We propose two beam selection algorithms. The first one, a heuristic ...


A Hybrid Early Decision-Probability Propagation Decoding Algorithm for Low-Density Parity-Check Codes

Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005., 2005

Low-density parity-check codes have recently received extensive attention as a forward error correction scheme in a wide area of applications. The decoding algorithm is inherently parallelizable, allowing communication at high speeds. One of the main disadvantages, however, is large memory requirements for interim storing of decoding data. In this paper, we investigate the performance of a hybrid decoding algorithm, using ...


Super Strongly Perfect ness of Prism and Rook's Networks

2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering, 2013

A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal dominating set that meets all the maximal complete sub graphs of H. In this paper we have characterized the structure of super strongly perfect graphs in Prism and Rook's Networks. Along with this characterization, we have investigated the Super Strongly Perfect ...


More Xplore Articles

Educational Resources on Bipartite graph

Back to Top

IEEE-USA E-Books

  • On derandomizing tests for certain polynomial identities

    We extract a paradigm for derandomizing tests for polynomial identities from the recent AKS primality testing algorithm. We then discuss its possible application to other tests.

  • Application of an improved Hungarian algorithm in semantic WEB service discovery

    The important step towards Web service implement is the discovery of required services. Traditional Web service uses UDDI, WSDL standards etc. Keywords based searching is used in the traditional service discovery. For needing manual intervention and lack of semantic description, the methods before have low precision rate. Semantic Web service problem can be reduced to an assignment problem. A mathematical model is achieved to account for the assignment problem. Similarity matrix is formed based on service request interface parameters and service advertisement interface parameters. The improved Hungarian algorithm is described to find the answer of mathematical model and discover the optimum service by searching for feasible matching plan. Meanwhile an algorithmic instance is given to illustrate the improved Hungarian algorithm could help requester find out the right request service. The test indicates that this algorithm increases the precision ratio and the recall ratio of Web service.

  • Low-Complexity Beam Selection Algorithms for Millimeter Wave Beamspace MIMO Systems

    We consider downlink multi-user multiple-input multiple-output (MIMO) systems, operating at millimeter Wave (mmWave) frequencies and equipped with a large number of antenna elements at the access point. Beamspace MIMO with beam selection offers an attractive solution for reducing the number of required radio frequency (RF) chains in such systems. We propose two beam selection algorithms. The first one, a heuristic greedy algorithm that enjoys low computational complexity with moderate performance. By modeling beam selection as maximum weight matching over a bipartite graph, we propose beam selection based on Kuhn-Munkres algorithm, and importantly, introduce a new formal framework for beam selection.

  • A Hybrid Early Decision-Probability Propagation Decoding Algorithm for Low-Density Parity-Check Codes

    Low-density parity-check codes have recently received extensive attention as a forward error correction scheme in a wide area of applications. The decoding algorithm is inherently parallelizable, allowing communication at high speeds. One of the main disadvantages, however, is large memory requirements for interim storing of decoding data. In this paper, we investigate the performance of a hybrid decoding algorithm, using an approximating early decision algorithm and a regular probability propagation algorithm. When the early decision algorithm fails, the block is re-decoded using a probability propagation decoder. As almost all errors are detectable, the error correction performance of the hybrid algorithm is negligibly detonated. However, simulations still achieve a 32% decrease of memory accesses

  • Super Strongly Perfect ness of Prism and Rook's Networks

    A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal dominating set that meets all the maximal complete sub graphs of H. In this paper we have characterized the structure of super strongly perfect graphs in Prism and Rook's Networks. Along with this characterization, we have investigated the Super Strongly Perfect ness in Prism and Rook's Networks. Also we have given the relationship between diameter, domination and co-domination numbers of Prism Network.

  • Parallel approximate matching

    The author solves the maximum cardinality matching problem approximately. Determining the parallel complexity of maximum cardinality matching in bipartite graphs is a famous open problem in parallel algorithm design. The problem is known to be in RNC, but all known fast parallel algorithms that find maximum cardinality matchings require the use of random numbers. They are based on matrix algebra, and are inherently efficient for sparse graphs. Therefore, the problem of finding an approximate maximum cardinality matching is considered. The parallel matching algorithm of A. Goldberg et al. (1988) can be modified so that it runs in O(a/sup 2/ log/sup 3/ n) time on an exclusive read exclusive write (EREW) parallel random access machine (PRAM) with n+m processors and finds a matching of size (1-1/a)p when given a graph with n vertices, m edges and a maximum cardinality matching of size p. The resulting algorithm is deterministic.<<ETX>>

  • Graph-based code construction for data storage

    In this paper, we propose a graph-based construction method for distributed data storage codes design. Relations among storage cost, repair cost and repair outage (probability where repair fails) are obtained in terms of the structural properties of the underlying graph. As a result, our approach can simplify the code design problem. Tradeoffs among different system parameters are also obtained.

  • LDPC Codes of Arbitrary Girth

    For regular, degree two LDPC (low density parity-check) codes, there is a strong relationship between high girth and performance. This article presents a greedy algorithm, called successive level growth (SLG), for the construction of LDPC codes with arbitrarily specified girth. The simulation results show that our codes exhibit significant coding gains over randomly constructed LDPC codes and in some cases outperform PEG codes in the additive white Gaussian noise channel.

  • Multi-Layered Networks for Visualizing the Interactions between Heterogeneous Proteins

    Recent improvements in high-throughput proteomics technology have produced a large amount of protein interaction data. Due to the volume of data, a graphical representation of protein interactions has proven to be much easier to understand than a long list of interacting proteins. For the past years we have studied the interactions between virus proteins and host cell proteins, but most methods that are typically used for visualizing protein interactions are not appropriate for the interactions between proteins of different types. These methods are intended for the interactions between proteins of a same type, and do not distinguish the interactions between proteins of a same type from those of different types. Visualization of the interactions between different types of proteins (such as virus proteins and host cell proteins) requires a new graph layout algorithm. This paper discusses a new layout algorithm for visualizing the interactions between heterogeneous proteins, and its application to the interactions between virus proteins and human proteins.

  • Modeling the interconnects of Xilinx Virtex FPGAs and derivation of their test configurations

    The paper employs bipartite graphs to model the local interconnect resources of Xilinx Virtex field programmable gate arrays (FPGAs). A computer algorithm is introduced to derive a minimal or near minimal set of test configurations (TCs) by solving edge coloring problems of the graphs, where each color represents a TC. A minimal set of 26 TCs was obtained for Virtex FPGAs.



Standards related to Bipartite graph

Back to Top

No standards are currently tagged "Bipartite graph"


Jobs related to Bipartite graph

Back to Top