NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 1 of 1 (0.053 seconds)
1

Efficient Enumeration of all Connected Induced Subgraphs of a Large Undirected Graph

Maxwell, Sean T. 21 February 2014 (has links)
No description available.
Bioinformatics
Computer Science
connected induced subgraph
subgraph enumeration
hereditary property
branch and bound
depth first search
enumeration tree

Page generated in 0.0561 seconds