Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Ensemble dominant")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 605

  • Page / 25
Export

Selection :

  • and

Domination alteration sets in graphsBAUER, D; HARARY, F; NIEMINEN, J et al.Discrete mathematics. 1983, Vol 47, Num 2-3, pp 153-161, issn 0012-365XArticle

Domination, independent domination, and duality in strongly chordal graphsFARBER, M.Discrete applied mathematics. 1984, Vol 7, Num 2, pp 115-130, issn 0166-218XArticle

Clustering and domination in perfect graphsCORNEIL, D. G; PERL, Y.Discrete applied mathematics. 1984, Vol 9, Num 1, pp 27-39, issn 0166-218XArticle

On the exponential cardinality of FDS for the ordered p-median problemPUERTO, J; RODRIGUEZ-CHIA, A. M.Operations research letters. 2005, Vol 33, Num 6, pp 641-651, issn 0167-6377, 11 p.Article

On miniaturized problems in parameterized complexity theoryYIJIA CHEN; FLUM, Jörg.Lecture notes in computer science. 2004, pp 108-120, issn 0302-9743, isbn 3-540-23071-8, 13 p.Conference Paper

Structure and recognition of domishold graphsMARCHIORO, P; MORGANA, A.Discrete mathematics. 1984, Vol 50, Num 2-3, pp 239-251, issn 0012-365XArticle

On the algorithmic complexity of total dominationLASKAR, R; PFAFF, J; HEDETNIEMI, S. M et al.SIAM journal on algebraic and discrete methods. 1984, Vol 5, Num 3, pp 420-425, issn 0196-5212Article

NONBLOCKER : Parameterized algorithmics for MINIMUM DOMINATING SETDEHNE, Frank; FELLOWS, Michael; FEMAU, Henning et al.Lecture notes in computer science. 2006, pp 237-245, issn 0302-9743, isbn 3-540-31198-X, 1Vol, 9 p.Conference Paper

Bounding the number of minimal dominating sets : A measure and conquer approachFOMIN, Fedor V; GRANDONI, Fabrizio; PYATKIN, Artem V et al.Lecture notes in computer science. 2005, pp 573-582, issn 0302-9743, isbn 3-540-30935-7, 1Vol, 10 p.Conference Paper

On k-dependent dominationFAVARON, O; HEDETNIEMI, S. M; HEDETNIEMI, S. T et al.Discrete mathematics. 2002, Vol 249, Num 1-3, pp 83-94, issn 0012-365XConference Paper

Linear time algorithms for generalized edge dominating set problemsBERGER, André; PAREKH, Ojas.Lecture notes in computer science. 2005, pp 233-243, issn 0302-9743, isbn 3-540-28101-0, 11 p.Conference Paper

The parameterized complexity of maximality and minimality problemsYIJIA CHEN; FLUM, Jörg.Lecture notes in computer science. 2006, pp 25-37, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 13 p.Conference Paper

Dominating sets and local treewidthFOMIN, Fedor V; THILIKOS, Dimtirios M.Lecture notes in computer science. 2003, pp 221-229, issn 0302-9743, isbn 3-540-20064-9, 9 p.Conference Paper

A synchronous self-stabilizing minimal domination protocol in an arbitrary network graphXU, Z; HEDETNIEMI, S. T; GODDARD, W et al.Lecture notes in computer science. 2003, pp 26-32, issn 0302-9743, isbn 3-540-20745-7, 7 p.Conference Paper

Remarks about disjoint dominating setsHENNING, Michael A; LÖWENSTEIN, Christian; RAUTENBACH, Dieter et al.Discrete mathematics. 2009, Vol 309, Num 23-24, pp 6451-6458, issn 0012-365X, 8 p.Article

DOMINATION-BALANCED GRAPHSPAYAN C; XUONG NH.1982; J. GR. THEORY; ISSN 0364-9024; USA; DA. 1982; VOL. 6; NO 1; PP. 23-32; BIBL. 2 REF.Article

ADOMATIC AND IDOMATIC NUMBERS OF GRAPHSZELINKA B.1983; MATH. SLOV.; ISSN 0139-9918; CSK; DA. 1983; VOL. 33; NO 1; PP. 99-103; ABS. RUS; BIBL. 1 REF.Article

DOMATIC NUMBERS OF CUBE GRAPHSZELINKA B.1982; MATH. SLOV.; ISSN 0139-9918; CSK; DA. 1982; VOL. 32; NO 2; PP. 117-119; ABS. RUS; BIBL. 2 REF.Article

TOWARDS A THEORY OF DOMINATION IN GRAPHS.COCKAYNE EJ; HEDETNIEMI ST.1977; NETWORKS; U.S.A.; DA. 1977; VOL. 7; NO 3; PP. 247-261; BIBL. 1 P. 1/2Article

Fault-tolerant locating-dominating setsSLATER, Peter J.Discrete mathematics. 2002, Vol 249, Num 1-3, pp 179-189, issn 0012-365XConference Paper

ON DOMINATION RELATED CONCEPTS IN GRAPH THEORYRENU LASKAR; WALIKAR HB.1981; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1981; NO 885; PP. 308-320; BIBL. 32 REF.Conference Paper

THE STRONG DOMINATION NUMBER OF A GRAPH AND RELATED CONCEPTSACHARYA BD.1980; J. MATH. & PHYS. SCI.; ISSN 0047-2557; IND; DA. 1980; VOL. 14; NO 5; PP. 471-475; BIBL. 5 REF.Article

COMPLEXITY OF FINDING K-PATH-FREE DOMINATING SETS IN GRAPHSBAR YEHUDA R; VISHKIN U.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 14; NO 5; PP. 228-232; BIBL. 8 REF.Article

Total restrained domination in claw-free graphsHONGXING JIANG; LIYING KANG.Journal of combinatorial optimization. 2010, Vol 19, Num 1, pp 60-68, issn 1382-6905, 9 p.Article

A survey of selected recent results on total domination in graphsHENNING, Michael A.Discrete mathematics. 2009, Vol 309, Num 1, pp 32-63, issn 0012-365X, 32 p.Article

  • Page / 25