Bipartite graphs of small readability

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	Bipartite graphs of small readability
Authors:	ID Chikhi, Rayan (Author) ID Jovičić, Vladan (Author) ID Kratsch, Stefan (Author) ID Medvedev, Paul (Author) ID Milanič, Martin (Author) ID Raskhodnikova, Sofya (Author) ID Varma, Nithin (Author)
Files:	https://www.sciencedirect.com/science/article/pii/S0304397519304578?via%3Dihub
Language:	English
Work type:	Unknown
Typology:	1.01 - Original Scientific Article
Organization:	IAM - Andrej Marušič Institute
Keywords:	bipartite graph, readability, bipartite chain graph, polynomial-time algorithm, grid graph
Year of publishing:	2019
Number of pages:	str. 1-18
PID:	20.500.12556/RUP-11821
UDC:	519.17
ISSN on article:	0304-3975
DOI:	10.1016/j.tcs.2019.07.022
COBISS.SI-ID:	1541431236
Publication date in RUP:	26.07.2019
Views:	2441
Downloads:	102
Metadata:
:	CHIKHI, Rayan, JOVIČIĆ, Vladan, KRATSCH, Stefan, MEDVEDEV, Paul, MILANIČ, Martin, RASKHODNIKOVA, Sofya and VARMA, Nithin, 2019, Bipartite graphs of small readability. Theoretical computer science [online]. 2019. P. 1–18. [Accessed 7 April 2025]. DOI 10.1016/j.tcs.2019.07.022. Retrieved from: https://www.sciencedirect.com/science/article/pii/S0304397519304578?via%3Dihub Copy citation

Average score:	0.5 1 1.5 2 2.5 3 3.5 4 4.5 5 (0 votes)
Your score:	Voting is allowed only for logged in users.
Share:

Searching for similar works... Please wait....

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Title:	Theoretical computer science
Shortened title:	Theor. comp. sci.
Publisher:	Elsevier
ISSN:	0304-3975
COBISS.SI-ID:	26525952

Language:	English
Keywords:	dvodelen graf, odčitljivost, dvodelen verižen graf, polinomski algoritem, mrežni graf

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back