Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 5764893

From MaRDI portal
Publication:3579486
Jump to:navigation, search

zbMATH Open1192.05152MaRDI QIDQ3579486FDOQ3579486


Authors: Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi Edit this on Wikidata


Publication date: 6 August 2010



Title of this publication is not available (Why is that?)




Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Connectivity (05C40)



Cited In (3)

  • A new contraction technique with applications to congruency-constrained cuts
  • A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph
  • Fast algorithms via dynamic-oracle matroids





This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579486)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3579486&oldid=16983848"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 02:44. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki