Results 241 to 250 of about 315,031 (267)
Some of the next articles are maybe not open access.
Mod-2 Independence and Domination in Graphs
International Journal of Foundations of Computer Science, 1999We develop an O(n3) algorithm for deciding if an n-vertex digraph has a subset of vertices with the property that each vertex of the graph has an even number of arcs into the subset. This algorithm allows us to give a combinatorial interpretation of Gauss-Jordan and Gauss elimination on square boolean matrices. In addition to solving this independence-
Halldórsson, Magnús M. +2 more
openaire +2 more sources
New Results on Weighted Independent Domination
2017Weighted independent domination is an NP-hard graph problem, which remains computationally intractable in many restricted graph classes. Only few examples of classes are available, where the problem admits polynomial-time solutions. In the present paper, we extend the short list of such classes with two new examples.
Lozin, Vadim +3 more
openaire +2 more sources
Independent domination in trees
Discrete Mathematics, Algorithms and ApplicationsLet [Formula: see text] be a simple connected graph. A dominating set [Formula: see text] is an independent dominating set of graph [Formula: see text] if the subgraph induced by [Formula: see text] is isomorphic to an empty graph. The minimum cardinality of an independent dominating set, denoted by [Formula: see text], is called the independent ...
openaire +1 more source
Integrative oncology: Addressing the global challenges of cancer prevention and treatment
Ca-A Cancer Journal for Clinicians, 2022Jun J Mao,, Msce +2 more
exaly
Multidisciplinary standards of care and recent progress in pancreatic ductal adenocarcinoma
Ca-A Cancer Journal for Clinicians, 2020Aaron J Grossberg +2 more
exaly
Oral complications of cancer and cancer therapy
Ca-A Cancer Journal for Clinicians, 2012Joel B Epstein +2 more
exaly
American Cancer Society Head and Neck Cancer Survivorship Care Guideline
Ca-A Cancer Journal for Clinicians, 2016Nader Sadeghi +2 more
exaly

