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 Srivastava, Nidhi Varma (Author)
Files:	https://doi.org/10.1007/978-3-319-94776-1_39
Language:	English
Work type:	Unknown
Typology:	1.08 - Published Scientific Conference Contribution
Organization:	IAM - Andrej Marušič Institute
Keywords:	bipartite graph, readability, bipartite chain graph, polynomial-time algorithm, grid graph
Year of publishing:	2018
Number of pages:	Str. 467-479
PID:	20.500.12556/RUP-9789
UDC:	519.17
ISSN on article:	0302-9743
DOI:	10.1007/978-3-319-94776-1_39
COBISS.SI-ID:	1540526276
Publication date in RUP:	17.09.2018
Views:	3049
Downloads:	71
Metadata:
:	CHIKHI, Rayan, JOVIČIĆ, Vladan, KRATSCH, Stefan, MEDVEDEV, Paul, MILANIČ, Martin, RASKHODNIKOVA, Sofya and SRIVASTAVA, Nidhi Varma, 2018, Bipartite graphs of small readability. In : Computing and combinatorics [online]. Published Scientific Conference Contribution. 2018. p. 467–479. [Accessed 6 April 2025]. Retrieved from: https://doi.org/10.1007/978-3-319-94776-1_39 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:

Similar works from our repository:

Similar works from other repositories:

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

Title:	Computing and combinatorics
COBISS.SI-ID:	1540525764

Title:	Lecture notes in computer science
Shortened title:	Lect. notes comput. sci.
Publisher:	Springer
ISSN:	0302-9743
COBISS.SI-ID:	4292374

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