Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(FEEDBACK VERTEX SET). Showing records 1 – 9 of 9 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Kyoto University

1. Bao, Yu. Identification and Analysis of Critical Sites in RNA/Protein Sequences and Biological Networks .

Degree: 2018, Kyoto University

Subjects/Keywords: MicroRNA; Caspase; Feedback vertex set

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bao, Y. (2018). Identification and Analysis of Critical Sites in RNA/Protein Sequences and Biological Networks . (Thesis). Kyoto University. Retrieved from http://hdl.handle.net/2433/235113

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Bao, Yu. “Identification and Analysis of Critical Sites in RNA/Protein Sequences and Biological Networks .” 2018. Thesis, Kyoto University. Accessed December 01, 2020. http://hdl.handle.net/2433/235113.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Bao, Yu. “Identification and Analysis of Critical Sites in RNA/Protein Sequences and Biological Networks .” 2018. Web. 01 Dec 2020.

Vancouver:

Bao Y. Identification and Analysis of Critical Sites in RNA/Protein Sequences and Biological Networks . [Internet] [Thesis]. Kyoto University; 2018. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/2433/235113.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bao Y. Identification and Analysis of Critical Sites in RNA/Protein Sequences and Biological Networks . [Thesis]. Kyoto University; 2018. Available from: http://hdl.handle.net/2433/235113

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Victoria

2. Wodlinger, Jane. Irreversible k-threshold conversion processes on graphs.

Degree: Department of Mathematics and Statistics, 2018, University of Victoria

 Given a graph G and an initial colouring of its vertices with two colours, say black and white, an irreversible k-threshold conversion process on G… (more)

Subjects/Keywords: graph theory; conversion process; irreversible conversion process; k-conversion; decycling; feedback vertex; k-threshold; vertex arboricity; conversion set; forest partition

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wodlinger, J. (2018). Irreversible k-threshold conversion processes on graphs. (Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/9282

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Wodlinger, Jane. “Irreversible k-threshold conversion processes on graphs.” 2018. Thesis, University of Victoria. Accessed December 01, 2020. https://dspace.library.uvic.ca//handle/1828/9282.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Wodlinger, Jane. “Irreversible k-threshold conversion processes on graphs.” 2018. Web. 01 Dec 2020.

Vancouver:

Wodlinger J. Irreversible k-threshold conversion processes on graphs. [Internet] [Thesis]. University of Victoria; 2018. [cited 2020 Dec 01]. Available from: https://dspace.library.uvic.ca//handle/1828/9282.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wodlinger J. Irreversible k-threshold conversion processes on graphs. [Thesis]. University of Victoria; 2018. Available from: https://dspace.library.uvic.ca//handle/1828/9282

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Universiteit Utrecht

3. Timmer, S.T. Exact Algorithms for Loop Cutset.

Degree: 2012, Universiteit Utrecht

 The LOOP CUTSET problem was historically posed by Pearl as a subroutine in Pearl’s algorithm for computing inference in probabilistic networks. The efficiency of the… (more)

Subjects/Keywords: LOOP CUTSET; MAXIMUM INDUCED FOREST; Exact Algorithms; Treewidth; Cut & Count; Branch & Bound; Branch & Reduce; FEEDBACK VERTEX SET

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Timmer, S. T. (2012). Exact Algorithms for Loop Cutset. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/253746

Chicago Manual of Style (16th Edition):

Timmer, S T. “Exact Algorithms for Loop Cutset.” 2012. Masters Thesis, Universiteit Utrecht. Accessed December 01, 2020. http://dspace.library.uu.nl:8080/handle/1874/253746.

MLA Handbook (7th Edition):

Timmer, S T. “Exact Algorithms for Loop Cutset.” 2012. Web. 01 Dec 2020.

Vancouver:

Timmer ST. Exact Algorithms for Loop Cutset. [Internet] [Masters thesis]. Universiteit Utrecht; 2012. [cited 2020 Dec 01]. Available from: http://dspace.library.uu.nl:8080/handle/1874/253746.

Council of Science Editors:

Timmer ST. Exact Algorithms for Loop Cutset. [Masters Thesis]. Universiteit Utrecht; 2012. Available from: http://dspace.library.uu.nl:8080/handle/1874/253746

4. Cao, Yixin. Clustering and Inconsistent Information: A Kernelization Approach.

Degree: PhD, Computer Science, 2012, Texas A&M University

 Clustering is the unsupervised classification of patterns into groups, which is easy provided the data of patterns are consistent. However, real data are almost always… (more)

Subjects/Keywords: kernelization; clustering; feedback vertex set; fvs

…71 80 85 FEEDBACK VERTEX SET . . . . . . . . . . . . . . . . . . . . . . . . . 86 5.1… …feedback vertex set problem (FVS) on undirected graphs. In particular, a variation of… …the problem, the disjoint feedback vertex set problem (disjoint-FVS), to which the… …3 1.2 Variations of feedback set problems. . . . . . . . . . . . . . . . . . . . . . 10… …tree. 1.4 Feedback Set Problems Feedback sets problems are a collection of problems, whose… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7 Sample image

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Cao, Y. (2012). Clustering and Inconsistent Information: A Kernelization Approach. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11160

Chicago Manual of Style (16th Edition):

Cao, Yixin. “Clustering and Inconsistent Information: A Kernelization Approach.” 2012. Doctoral Dissertation, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11160.

MLA Handbook (7th Edition):

Cao, Yixin. “Clustering and Inconsistent Information: A Kernelization Approach.” 2012. Web. 01 Dec 2020.

Vancouver:

Cao Y. Clustering and Inconsistent Information: A Kernelization Approach. [Internet] [Doctoral dissertation]. Texas A&M University; 2012. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11160.

Council of Science Editors:

Cao Y. Clustering and Inconsistent Information: A Kernelization Approach. [Doctoral Dissertation]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11160

5. Bergougnoux, Benjamin. Matrix decompositions and algorithmic applications to (hyper)graphs : Décomposition de matrices et applications algorithmiques aux (hyper)graphes.

Degree: Docteur es, Informatique, 2019, Clermont Auvergne

Durant ces dernières décennies, d'importants efforts et beaucoup de café ont été dépensés en vue de caractériser les instances faciles des problèmes NP-difficiles. Dans ce… (more)

Subjects/Keywords: Largeur de clique; Largeur de rang; Largeur de couplage induit; D-neibhor equivalence; Connexité; Acyclicité; Cycle hamiltonian; Feedback vertex set; Comptage; Transversaux minimaux; Dominants minimaux; Beta-acyclicité; Clique-width; Rank-width; Mim-width; D-neighbor equivalence; Connectivity; Acyclicyty; Feedback vertex set; Hamiltonian cycle; Counting; Minimal transversal; Minimal dominating set; Beta-acyclicyty

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bergougnoux, B. (2019). Matrix decompositions and algorithmic applications to (hyper)graphs : Décomposition de matrices et applications algorithmiques aux (hyper)graphes. (Doctoral Dissertation). Clermont Auvergne. Retrieved from http://www.theses.fr/2019CLFAC025

Chicago Manual of Style (16th Edition):

Bergougnoux, Benjamin. “Matrix decompositions and algorithmic applications to (hyper)graphs : Décomposition de matrices et applications algorithmiques aux (hyper)graphes.” 2019. Doctoral Dissertation, Clermont Auvergne. Accessed December 01, 2020. http://www.theses.fr/2019CLFAC025.

MLA Handbook (7th Edition):

Bergougnoux, Benjamin. “Matrix decompositions and algorithmic applications to (hyper)graphs : Décomposition de matrices et applications algorithmiques aux (hyper)graphes.” 2019. Web. 01 Dec 2020.

Vancouver:

Bergougnoux B. Matrix decompositions and algorithmic applications to (hyper)graphs : Décomposition de matrices et applications algorithmiques aux (hyper)graphes. [Internet] [Doctoral dissertation]. Clermont Auvergne; 2019. [cited 2020 Dec 01]. Available from: http://www.theses.fr/2019CLFAC025.

Council of Science Editors:

Bergougnoux B. Matrix decompositions and algorithmic applications to (hyper)graphs : Décomposition de matrices et applications algorithmiques aux (hyper)graphes. [Doctoral Dissertation]. Clermont Auvergne; 2019. Available from: http://www.theses.fr/2019CLFAC025

6. Montalva Medel, Marco. Problèmes type "Feedback Set" et comportement dynamique des réseaux de régulation : Feedback Set Problems and Dynamical Behavior in Regulatory Networks.

Degree: Docteur es, Modeles, methodes et algorithmes en biologie, santé et environnement, 2011, Grenoble; Universidad de Concepción (Chili)

 Dans la nature existent de nombreux exemples de systèmes dynamiques complexes: systèmes neuronaux, communautés, écosystèmes, réseaux de régulation génétiques, etc. Ces derniers, en particulier, sont… (more)

Subjects/Keywords: Ensemble de noeud recouvrent les cycles; NP-complet; Point fixe; Digraphe signé; Digraphe update; Feedback vertex set; NP-complete; Fixed point; Signed digraph; Update digraph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Montalva Medel, M. (2011). Problèmes type "Feedback Set" et comportement dynamique des réseaux de régulation : Feedback Set Problems and Dynamical Behavior in Regulatory Networks. (Doctoral Dissertation). Grenoble; Universidad de Concepción (Chili). Retrieved from http://www.theses.fr/2011GRENS014

Chicago Manual of Style (16th Edition):

Montalva Medel, Marco. “Problèmes type "Feedback Set" et comportement dynamique des réseaux de régulation : Feedback Set Problems and Dynamical Behavior in Regulatory Networks.” 2011. Doctoral Dissertation, Grenoble; Universidad de Concepción (Chili). Accessed December 01, 2020. http://www.theses.fr/2011GRENS014.

MLA Handbook (7th Edition):

Montalva Medel, Marco. “Problèmes type "Feedback Set" et comportement dynamique des réseaux de régulation : Feedback Set Problems and Dynamical Behavior in Regulatory Networks.” 2011. Web. 01 Dec 2020.

Vancouver:

Montalva Medel M. Problèmes type "Feedback Set" et comportement dynamique des réseaux de régulation : Feedback Set Problems and Dynamical Behavior in Regulatory Networks. [Internet] [Doctoral dissertation]. Grenoble; Universidad de Concepción (Chili); 2011. [cited 2020 Dec 01]. Available from: http://www.theses.fr/2011GRENS014.

Council of Science Editors:

Montalva Medel M. Problèmes type "Feedback Set" et comportement dynamique des réseaux de régulation : Feedback Set Problems and Dynamical Behavior in Regulatory Networks. [Doctoral Dissertation]. Grenoble; Universidad de Concepción (Chili); 2011. Available from: http://www.theses.fr/2011GRENS014


Texas A&M University

7. Lu, Songjian. Randomized and Deterministic Parameterized Algorithms and Their Applications in Bioinformatics.

Degree: PhD, Computer Science, 2010, Texas A&M University

 Parameterized NP-hard problems are NP-hard problems that are associated with special variables called parameters. One example of the problem is to find simple paths of… (more)

Subjects/Keywords: Algorithm; parameterized NP-hard problems; fixed parameter tractable; Directed feedback back vertex set problem; bioinformatics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lu, S. (2010). Randomized and Deterministic Parameterized Algorithms and Their Applications in Bioinformatics. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7222

Chicago Manual of Style (16th Edition):

Lu, Songjian. “Randomized and Deterministic Parameterized Algorithms and Their Applications in Bioinformatics.” 2010. Doctoral Dissertation, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7222.

MLA Handbook (7th Edition):

Lu, Songjian. “Randomized and Deterministic Parameterized Algorithms and Their Applications in Bioinformatics.” 2010. Web. 01 Dec 2020.

Vancouver:

Lu S. Randomized and Deterministic Parameterized Algorithms and Their Applications in Bioinformatics. [Internet] [Doctoral dissertation]. Texas A&M University; 2010. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7222.

Council of Science Editors:

Lu S. Randomized and Deterministic Parameterized Algorithms and Their Applications in Bioinformatics. [Doctoral Dissertation]. Texas A&M University; 2010. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7222

8. Bell, Nick. A Branch and Cut Approach to the Feedback Vertex Set Problem.

Degree: MA, Engineering, 2018, Rice University

 In this thesis, I use a branch and cut implementation to solve the feedback vertex set problem and add new facet defining inequalities to the… (more)

Subjects/Keywords: Branch and Cut; Feedback Vertex Set; Graph Theory; Combinatorial Optimization; Facet

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bell, N. (2018). A Branch and Cut Approach to the Feedback Vertex Set Problem. (Masters Thesis). Rice University. Retrieved from http://hdl.handle.net/1911/105909

Chicago Manual of Style (16th Edition):

Bell, Nick. “A Branch and Cut Approach to the Feedback Vertex Set Problem.” 2018. Masters Thesis, Rice University. Accessed December 01, 2020. http://hdl.handle.net/1911/105909.

MLA Handbook (7th Edition):

Bell, Nick. “A Branch and Cut Approach to the Feedback Vertex Set Problem.” 2018. Web. 01 Dec 2020.

Vancouver:

Bell N. A Branch and Cut Approach to the Feedback Vertex Set Problem. [Internet] [Masters thesis]. Rice University; 2018. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1911/105909.

Council of Science Editors:

Bell N. A Branch and Cut Approach to the Feedback Vertex Set Problem. [Masters Thesis]. Rice University; 2018. Available from: http://hdl.handle.net/1911/105909

9. Chandrasekaran, Karthekeyan. New approaches to integer programming.

Degree: PhD, Algorithms, Combinatorics, and Optimization, 2012, Georgia Tech

 Integer Programming (IP) is a powerful and widely-used formulation for combinatorial problems. The study of IP over the past several decades has led to fascinating… (more)

Subjects/Keywords: Random graphs; Feedback vertex set; Cutting plane method; Integer program; Discrepancy; Random; Matching; Integer programming; Programming (Mathematics); Algorithms

…combinatorial approach to give an approximation algorithm for the feedback vertex set problem (… …to analyze simple online algorithms for the Feedback Vertex Set problem (FVS) in… …approximation algorithm for the feedback vertex set problem in the Implicit Hitting Set framework. Our… …algorithm is a simple online algorithm that finds a nearly optimal feedback vertex set in random… …propose a planted model for the feedback vertex set problem similar to the well-studied planted… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chandrasekaran, K. (2012). New approaches to integer programming. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/44814

Chicago Manual of Style (16th Edition):

Chandrasekaran, Karthekeyan. “New approaches to integer programming.” 2012. Doctoral Dissertation, Georgia Tech. Accessed December 01, 2020. http://hdl.handle.net/1853/44814.

MLA Handbook (7th Edition):

Chandrasekaran, Karthekeyan. “New approaches to integer programming.” 2012. Web. 01 Dec 2020.

Vancouver:

Chandrasekaran K. New approaches to integer programming. [Internet] [Doctoral dissertation]. Georgia Tech; 2012. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1853/44814.

Council of Science Editors:

Chandrasekaran K. New approaches to integer programming. [Doctoral Dissertation]. Georgia Tech; 2012. Available from: http://hdl.handle.net/1853/44814

.