OpenAlex
PricingAboutJobs
Log inGet started
Work

On Maximal Chain Subgraphs and Covers of Bipartite Graphs.

HTML

Year: 2016
Type: conference-paper
Source: IRIS Research product catalog (Sapienza University of Rome)
DOI: 10.1007/978-3-319-44543-4
Authors: Tiziana Calamoneri, Mattia Gastaldello, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri
Institutions: Sapienza University of Rome, Université de Lyon, Institut national de recherche en sciences et technologies du numérique
Language: English

Topic: Advanced Graph Theory Research
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: bipartite graphs, enumeration algorithms, polynomial delay, exact exponential algorithms, quasi-polynomial time

Open Access status: green
OpenAlex ID: W2950551167
FWCI:
Cites: 1
Cited by: 2
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security