Lupa

Show document

A- | A+ | Print
Title:Avoidable vertices and edges in graphs
Authors:Beisegel, Jesse (Author)
Chudnovsky, Maria (Author)
Gurvich, Vladimir (Author)
Milanič, Martin (Author)
Servatius, Mary (Author)
Files:URL https://link.springer.com/chapter/10.1007%2F978-3-030-24766-9_10
 
Language:English
Work type:Unknown
Tipology:1.08 - Published Scientific Conference Contribution
Organization:IAM - Andrej Marušič Institute
Keywords:simplicial vertex, avoidable vertex, avoidable edge, avoidable path, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graph
Year of publishing:2019
Number of pages:Str. 126-139
UDC:519.17:004
ISSN on article:0302-9743
COBISS_ID:1541456068 Link is opened in a new window
DOI:10.1007/978-3-030-24766-9_10 Link is opened in a new window
Views:251
Downloads:83
Metadata:XML RDF-CHPDL DC-XML DC-RDF
Categories:Document is not linked to any category.
:
  
Average score:(0 votes)
Your score:Voting is allowed only to 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:Algorithms and data structures
COBISS.SI-ID:1541455812 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:simplicialna točka, izogibna točka, izogibna povezava, izogibna pot, problem najtežje klike, polinomski algoritem, ciklično usmerljiv graf

Comments

Leave comment

You have to 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