Results 251 to 260 of about 507,111 (281)
Some of the next articles are maybe not open access.
1995
Summary: We introduce and study the concept of \(F\)-coverable graphs. For two graphs \(F\) and \(G\), we say that \(G\) is \(F\)-coverable if some weights \(f(H)\) can be assigned to the subgraphs \(H\) isomorphic to \(F\) in \(G\) in such a way that \[ 0\leq f(H)\leq 1\quad\text{and} \quad \sum_{e\in H\subset G} f(H)= 1 \] holds for every edge \(e ...
MILICI, Salvatore, Tuza Z.
openaire +2 more sources
Summary: We introduce and study the concept of \(F\)-coverable graphs. For two graphs \(F\) and \(G\), we say that \(G\) is \(F\)-coverable if some weights \(f(H)\) can be assigned to the subgraphs \(H\) isomorphic to \(F\) in \(G\) in such a way that \[ 0\leq f(H)\leq 1\quad\text{and} \quad \sum_{e\in H\subset G} f(H)= 1 \] holds for every edge \(e ...
MILICI, Salvatore, Tuza Z.
openaire +2 more sources
1996
Within the framework of concurrent systems, several verification approaches require as a preliminary step the complete derivation of the state space. Partial-order methods are efficient for reducing the state explosion due to the representation of parallelism by interleaving.
François Vernadat +2 more
openaire +1 more source
Within the framework of concurrent systems, several verification approaches require as a preliminary step the complete derivation of the state space. Partial-order methods are efficient for reducing the state explosion due to the representation of parallelism by interleaving.
François Vernadat +2 more
openaire +1 more source
Covering Graphs by Simple Circuits
SIAM Journal on Computing, 1981We show that any biconnected graph with n nodes and m edges can be covered by simple circuits whose total length is at most $\min (3m,m + 6n)$. Our proof suggests an efficient algorithm for finding such a cover.
Itai, Alon +3 more
openaire +2 more sources
Computers & Operations Research, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Labbé, Martine +2 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Labbé, Martine +2 more
openaire +2 more sources
Acta Mathematica Scientia, 1988
Let \(G=(V,E)\) be a finite graph and f, g two integer-valued functions g(x)\(\leq f(x)\) defined on V. A spanning subgraph G is called (g,f)-factor if \(g(v)\leq \deg_ F(v)\leq f(x)\) for any \(v\in V\). It is proved that G is (g,f)-covered, that means every edge \(e\in E\) belongs to some (g,f)- factor, if and only if \(\delta_ G(g,f,S,T)\geq e(g,f,S,
openaire +2 more sources
Let \(G=(V,E)\) be a finite graph and f, g two integer-valued functions g(x)\(\leq f(x)\) defined on V. A spanning subgraph G is called (g,f)-factor if \(g(v)\leq \deg_ F(v)\leq f(x)\) for any \(v\in V\). It is proved that G is (g,f)-covered, that means every edge \(e\in E\) belongs to some (g,f)- factor, if and only if \(\delta_ G(g,f,S,T)\geq e(g,f,S,
openaire +2 more sources
1990
Given a graph \(G\), a covering of \(G\) is a set of subgraphs \(\{G_ 1,G_ 2,\dots,G_ k\}\) such that every edge of \(G\) is in some \(G_ i\). A set of edges \(\{e_ 1,e_ 2,\dots,e_ k\}\) with \(e_ i\in E(G_ i)\) is called a set of distinct representing edges. \textit{L.
openaire +2 more sources
Given a graph \(G\), a covering of \(G\) is a set of subgraphs \(\{G_ 1,G_ 2,\dots,G_ k\}\) such that every edge of \(G\) is in some \(G_ i\). A set of edges \(\{e_ 1,e_ 2,\dots,e_ k\}\) with \(e_ i\in E(G_ i)\) is called a set of distinct representing edges. \textit{L.
openaire +2 more sources
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
Comparability Graphs Among Cover-Incomparability Graphs
2022Arun Anil, Manoj Changat
openaire +1 more source