English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs

Khachiyan, L., Boros, E., Borys, K., Elbassioni, K., & Gurvich, V. (2005). Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs. In Algorithms and computation (pp. 156-165). Berlin: Springer.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Khachiyan, Leonid1, Author
Boros, Endre1, Author
Borys, Konrad1, Author
Elbassioni, Khaled2, Author           
Gurvich, Vladimir1, Author
Deng, Xiaotie1, Editor
Du, Ding-Zhu1, Editor
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: 2006-04-202005
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 279151
Other: Local-ID: C1256428004B93B8-9A4AC153A88948D0C12571470000CE87-Elbassioni2005f
 Degree: -

Event

show
hide
Title: ISAAC 2005
Place of Event: Sanya, Hainan, China
Start-/End Date: 2005-12-19 - 2005-12-21

Legal Case

show

Project information

show

Source 1

show
hide
Title: Algorithms and computation
  Abbreviation : ISAAC 2005
  Subtitle : 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005. Proceedings
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 156 - 165 Identifier: ISBN: 3-540-30935-7

Source 2

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