Lupa

Show document Help

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:URL 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 This link opens in a new window
UDC:519.17
ISSN on article:0304-3975
DOI:10.1016/j.tcs.2019.07.022 This link opens in a new window
COBISS.SI-ID:1541431236 This link opens in a new window
Publication date in RUP:26.07.2019
Views:2020
Downloads:100
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share


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

Record is a part of a journal

Title:Theoretical computer science
Shortened title:Theor. comp. sci.
Publisher:Elsevier
ISSN:0304-3975
COBISS.SI-ID:26525952 This link opens in a new window

Secondary language

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


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica