
Contents
9 Four easy subclasses of graphs
Get access-
Published:March 1998
Cite
Abstract
In this chapter we consider three easy cases of matchings in special graphs: trees, dense graphs and regular bipartite graphs. They are easy in the sense of possessing simple NC-algorithms for the matching problem. Usually efficient sequential algorithms for trees also have quite efficient parallel implementations. Regular bipartite and dense graphs are among the few known families of graphs which possess perfect matchings. A tree is an undirected connected graph without cycles. Assume we choose a vertex called a root and direct all edges top down. The root is the topmost vertex. The leaves are degree 1 vertices (except the root). A tree can have no perfect matching, even if the number of vertices is even. For example, K1,n has only one edge in the maximum cardinality matching. Our approach to construct an NC-algorithm for trees is to ca greedy sequential algorithm in parallel.
Sign in
Personal account
- Sign in with email/username & password
- Get email alerts
- Save searches
- Purchase content
- Activate your purchase/trial code
- Add your ORCID iD
Purchase
Our books are available by subscription or purchase to libraries and institutions.
Purchasing informationMonth: | Total Views: |
---|---|
September 2024 | 3 |
Get help with access
Institutional access
Access to content on Oxford Academic is often provided through institutional subscriptions and purchases. If you are a member of an institution with an active account, you may be able to access content in one of the following ways:
IP based access
Typically, access is provided across an institutional network to a range of IP addresses. This authentication occurs automatically, and it is not possible to sign out of an IP authenticated account.
Sign in through your institution
Choose this option to get remote access when outside your institution. Shibboleth/Open Athens technology is used to provide single sign-on between your institution’s website and Oxford Academic.
If your institution is not listed or you cannot sign in to your institution’s website, please contact your librarian or administrator.
Sign in with a library card
Enter your library card number to sign in. If you cannot sign in, please contact your librarian.
Society Members
Society member access to a journal is achieved in one of the following ways:
Sign in through society site
Many societies offer single sign-on between the society website and Oxford Academic. If you see ‘Sign in through society site’ in the sign in pane within a journal:
If you do not have a society account or have forgotten your username or password, please contact your society.
Sign in using a personal account
Some societies use Oxford Academic personal accounts to provide access to their members. See below.
Personal account
A personal account can be used to get email alerts, save searches, purchase content, and activate subscriptions.
Some societies use Oxford Academic personal accounts to provide access to their members.
Viewing your signed in accounts
Click the account icon in the top right to:
Signed in but can't access content
Oxford Academic is home to a wide variety of products. The institutional subscription may not cover the content that you are trying to access. If you believe you should have access to that content, please contact your librarian.
Institutional account management
For librarians and administrators, your personal account also provides access to institutional account management. Here you will find options to view and activate subscriptions, manage institutional settings and access options, access usage statistics, and more.