Constrained ear decompositions in graphs and digraphs

Ear decompositions of graphs are a standard concept related to several major problems in graph theory like the Traveling Salesman Problem. For example, the Hamiltonian Cycle Problem, which is notoriously N P-complete, is equivalent to deciding whether a given graph admits an ear decomposition in whi...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής

Κύριοι συγγραφείς:	Frédéric Havet, Nicolas Nisse
Μορφή:	Artigo
Γλώσσα:	Inglês
Έκδοση:	Discrete Mathematics & Theoretical Computer Science 2019-09-01
Σειρά:	Discrete Mathematics & Theoretical Computer Science
Θέματα:	[info.info-dm]computer science [cs]/discrete mathematics [cs.dm] [info.info-cc]computer science [cs]/computational complexity [cs.cc]
Διαθέσιμο Online:	https://dmtcs.episciences.org/4544/pdf
Ετικέτες:	Προσθήκη ετικέτας Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!