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:(Independent Dominating). Showing records 1 – 4 of 4 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters

1. Phan, Raksmey. Méthodes exactes et approchées par partition en cliques de graphes : Exact and approximation methods by clique partition of graphs.

Degree: Docteur es, Informatique, 2013, Université Blaise-Pascale, Clermont-Ferrand II

Cette thèse se déroule au sein du projet ToDo (Time versus Optimality in discrete Optimization ANR 09-EMER-010) financé par l'Agence Nationale de la Recherche. Nous… (more)

Subjects/Keywords: Exact; Approximation; Heuristique gloutonne; Indépendant dominant; Vertex cover; Conflits; Exact; Approximation; Greedy Heuristic; Independent Dominating; Vertex Cover; Conflicts

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Phan, R. (2013). Méthodes exactes et approchées par partition en cliques de graphes : Exact and approximation methods by clique partition of graphs. (Doctoral Dissertation). Université Blaise-Pascale, Clermont-Ferrand II. Retrieved from http://www.theses.fr/2013CLF22396

Chicago Manual of Style (16th Edition):

Phan, Raksmey. “Méthodes exactes et approchées par partition en cliques de graphes : Exact and approximation methods by clique partition of graphs.” 2013. Doctoral Dissertation, Université Blaise-Pascale, Clermont-Ferrand II. Accessed November 17, 2019. http://www.theses.fr/2013CLF22396.

MLA Handbook (7th Edition):

Phan, Raksmey. “Méthodes exactes et approchées par partition en cliques de graphes : Exact and approximation methods by clique partition of graphs.” 2013. Web. 17 Nov 2019.

Vancouver:

Phan R. Méthodes exactes et approchées par partition en cliques de graphes : Exact and approximation methods by clique partition of graphs. [Internet] [Doctoral dissertation]. Université Blaise-Pascale, Clermont-Ferrand II; 2013. [cited 2019 Nov 17]. Available from: http://www.theses.fr/2013CLF22396.

Council of Science Editors:

Phan R. Méthodes exactes et approchées par partition en cliques de graphes : Exact and approximation methods by clique partition of graphs. [Doctoral Dissertation]. Université Blaise-Pascale, Clermont-Ferrand II; 2013. Available from: http://www.theses.fr/2013CLF22396

2. Mekiš, Gašper. Direktni produkti polnih grafov.

Degree: 2013, Univerza v Mariboru

Prvi del disertacije je posvečen neodvisnim dominantnim množicam direktnega produkta štirih polnih grafov. Eksplicitno so opisane T1-množice, tj. množice, kjer se poljubni par vozlišč ujema… (more)

Subjects/Keywords: direktni produkt grafov; dominantna množica; dominantno število; idomatska particija; krepka mavrična povezanost; neodvisna množica; mavrična povezanost; polna dominantna množica; polni graf; polno dominantno število; complete graph; direct product of graphs; dominating set; domination number; idomatic partition; independent set; rainbow connection number; strong rainbow connection number; total dominating set; total domination number; info:eu-repo/classification/udc/519.17(043.3)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mekiš, G. (2013). Direktni produkti polnih grafov. (Doctoral Dissertation). Univerza v Mariboru. Retrieved from https://dk.um.si/IzpisGradiva.php?id=39998 ; https://dk.um.si/Dokument.php?id=54461&dn= ; https://plus.si.cobiss.net/opac7/bib/19790856?lang=sl

Chicago Manual of Style (16th Edition):

Mekiš, Gašper. “Direktni produkti polnih grafov.” 2013. Doctoral Dissertation, Univerza v Mariboru. Accessed November 17, 2019. https://dk.um.si/IzpisGradiva.php?id=39998 ; https://dk.um.si/Dokument.php?id=54461&dn= ; https://plus.si.cobiss.net/opac7/bib/19790856?lang=sl.

MLA Handbook (7th Edition):

Mekiš, Gašper. “Direktni produkti polnih grafov.” 2013. Web. 17 Nov 2019.

Vancouver:

Mekiš G. Direktni produkti polnih grafov. [Internet] [Doctoral dissertation]. Univerza v Mariboru; 2013. [cited 2019 Nov 17]. Available from: https://dk.um.si/IzpisGradiva.php?id=39998 ; https://dk.um.si/Dokument.php?id=54461&dn= ; https://plus.si.cobiss.net/opac7/bib/19790856?lang=sl.

Council of Science Editors:

Mekiš G. Direktni produkti polnih grafov. [Doctoral Dissertation]. Univerza v Mariboru; 2013. Available from: https://dk.um.si/IzpisGradiva.php?id=39998 ; https://dk.um.si/Dokument.php?id=54461&dn= ; https://plus.si.cobiss.net/opac7/bib/19790856?lang=sl

3. Mameri, Djelloul. L'indépendant faiblement connexe : études algorithmiques et polyédrales : Weakly connected independent sets : algorithmic and polyhedral studies.

Degree: Docteur es, Informatique, 2014, Université Blaise-Pascale, Clermont-Ferrand II

Dans ce travail, nous nous intéressons à une topologie pour les réseaux de capteurs sans fil. Un réseau de capteurs sans fil peut être modélisé… (more)

Subjects/Keywords: Ensembles dominants; Indépendant faiblement connexe; Réseaux sans fil; Algorithme d’énumération exact; Polytope; Algorithme de coupes et branchement; Dominating set; Weakly connected independent set; Wireless networks; Exact algorithm; Branch-and-cut algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mameri, D. (2014). L'indépendant faiblement connexe : études algorithmiques et polyédrales : Weakly connected independent sets : algorithmic and polyhedral studies. (Doctoral Dissertation). Université Blaise-Pascale, Clermont-Ferrand II. Retrieved from http://www.theses.fr/2014CLF22513

Chicago Manual of Style (16th Edition):

Mameri, Djelloul. “L'indépendant faiblement connexe : études algorithmiques et polyédrales : Weakly connected independent sets : algorithmic and polyhedral studies.” 2014. Doctoral Dissertation, Université Blaise-Pascale, Clermont-Ferrand II. Accessed November 17, 2019. http://www.theses.fr/2014CLF22513.

MLA Handbook (7th Edition):

Mameri, Djelloul. “L'indépendant faiblement connexe : études algorithmiques et polyédrales : Weakly connected independent sets : algorithmic and polyhedral studies.” 2014. Web. 17 Nov 2019.

Vancouver:

Mameri D. L'indépendant faiblement connexe : études algorithmiques et polyédrales : Weakly connected independent sets : algorithmic and polyhedral studies. [Internet] [Doctoral dissertation]. Université Blaise-Pascale, Clermont-Ferrand II; 2014. [cited 2019 Nov 17]. Available from: http://www.theses.fr/2014CLF22513.

Council of Science Editors:

Mameri D. L'indépendant faiblement connexe : études algorithmiques et polyédrales : Weakly connected independent sets : algorithmic and polyhedral studies. [Doctoral Dissertation]. Université Blaise-Pascale, Clermont-Ferrand II; 2014. Available from: http://www.theses.fr/2014CLF22513

4. Mouawad, Amer. On Reconfiguration Problems: Structure and Tractability.

Degree: 2015, University of Waterloo

 Given an n-vertex graph G and two vertices s and t in G, determining whether there exists a path and computing the length of the… (more)

Subjects/Keywords: reconfiguration; solution space; complexity; fixed-parameter tractability; independent set; vertex cover; dominating set

…NPcomplete problems of Power Supply, Clique, Independent Set, Vertex Cover, Set Cover, Dominating… …Vertex Cover NPC PSPACEC Independent Set NPC PSPACEC Clique NPC PSPACEC Dominating Set NPC… …Reach to DS-Reach. . . . . . . 44 3.2 Graphs used for the dominating set reduction… …49 3.4 Minimum dominating sets for G1 . . . . . . . . . . . . . . . . . . . . . . . . 51… …58 3.7 Example of a canonical dominating set (red vertices) of a path… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mouawad, A. (2015). On Reconfiguration Problems: Structure and Tractability. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/9183

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):

Mouawad, Amer. “On Reconfiguration Problems: Structure and Tractability.” 2015. Thesis, University of Waterloo. Accessed November 17, 2019. http://hdl.handle.net/10012/9183.

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

MLA Handbook (7th Edition):

Mouawad, Amer. “On Reconfiguration Problems: Structure and Tractability.” 2015. Web. 17 Nov 2019.

Vancouver:

Mouawad A. On Reconfiguration Problems: Structure and Tractability. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2019 Nov 17]. Available from: http://hdl.handle.net/10012/9183.

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

Council of Science Editors:

Mouawad A. On Reconfiguration Problems: Structure and Tractability. [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/9183

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

.