English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  The Complexity of Contracting Bipartite Graphs into Small Cycles

Krithika, R., Sharma, R., & Tale, P. (2022). The Complexity of Contracting Bipartite Graphs into Small Cycles. In M. A. Bekos, & M. Kaufmann (Eds.), Graph-Theoretic Concepts in Computer Science (pp. 356-369). Berlin: Springer. doi:10.1007/978-3-031-15914-5_26.

Item is

Basic

show hide
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Krithika, R.1, Author
Sharma, Roohani2, Author           
Tale, Prafullkumar1, Author           
Affiliations:
1External Organizations, ou_persistent22              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20222022
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1007/978-3-031-15914-5_26
BibTex Citekey: KrithikaWG22
 Degree: -

Event

show
hide
Title: 48th International Workshop on Graph-Theoretic Concepts in Computer Science
Place of Event: Tübingen, Germany
Start-/End Date: 2022-06-22 - 2022-06-24

Legal Case

show

Project information

show

Source 1

show
hide
Title: Graph-Theoretic Concepts in Computer Science
  Abbreviation : WG 2022
  Subtitle : 48th International Workshop, WG 2022 ; Tübingen, Germany, June 22–24, 2022 ; Revised Selected Papers
Source Genre: Proceedings
 Creator(s):
Bekos, Michael A.1, Editor
Kaufmann, Michael1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 356 - 369 Identifier: ISBN: 978-3-031-15913-8

Source 2

show
hide
Title: Lecture Notes in Computer Science
  Abbreviation : LNCS
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 13453 Sequence Number: - Start / End Page: - Identifier: -