Print
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 Srivastava, Nidhi Varma (Author)
Files:URL 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 This link opens in a new window
UDC:519.17
ISSN on article:0302-9743
DOI:10.1007/978-3-319-94776-1_39 This link opens in a new window
COBISS.SI-ID:1540526276 This link opens in a new window
Publication date in RUP:17.09.2018
Views:1819
Downloads:67
Metadata:XML RDF-CHPDL 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 proceedings

Title:Computing and combinatorics
COBISS.SI-ID:1540525764 This link opens in a new window

Record is a part of a journal

Title:Lecture notes in computer science
Shortened title:Lect. notes comput. sci.
Publisher:Springer
ISSN:0302-9743
COBISS.SI-ID:4292374 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