Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article; zbMATH DE number 2230256

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

zbMath1075.05548MaRDI QIDQ5708549

Frederik Stork, Marc Uetz

Publication date: 18 November 2005

Full work available at URL: http://www.sciencedirect.com/science/journal/15710653

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.


Mathematics Subject Classification ID

Enumeration in graph theory (05C30)




Cites Work

  • On generating all maximal independent sets
  • The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
  • Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
  • Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
  • Unnamed Item
  • Unnamed Item


This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5708549&oldid=30430720"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 March 2024, at 04:40.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki