Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Rasmussen, Craig W."'
Autor:
Rasmussen, Craig W.
Let G = ( V, E) be a simple graph. A vertex labeling is a bijection f: V → { l, 2, ... ,!VI}. The weight w(e) of an edge e = uv ∈E is given by w(e) = min{f(u), f(v)}. The minimum-sum ver~ex cover is a vertex labeling that minimizes ∑ₑ∈ ᴇ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2778::739bbd854ef9d8beccdbc6471d751f26
https://hdl.handle.net/10945/57320
https://hdl.handle.net/10945/57320
The article of record as published may be located at http://utilitasmathematica.org/ Congr. Numer. 178 (2006), 161-172. Let G be a graph with the vertex set V (G), edge set E(G). A vertex labeling is a bijection f : V (G) _ {1, 2, . . . , |V (G)|}, a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2778::67b4d14c6a1698e4dca39263d0a29283
https://hdl.handle.net/10945/25555
https://hdl.handle.net/10945/25555
Congr. Numer. 181 (2006) 19-32 Given a graph G, the dominator coloring problem seeks a proper coloring of G with the additional property that every vertex in the graph dominates an entire color class. The safe clique partition problem seeks a partiti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2778::3bd5f72cc6cf3de547d92ef59ee76582
https://hdl.handle.net/10945/25506
https://hdl.handle.net/10945/25506
Large complex systems need to be analyzed prior to operation so that those depending upon them for the protection of their information have a well defined understanding of the measures that have been taken to achieve security and the residual risk th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2778::7792e5dac6a7684a86238b62c4698e89
https://hdl.handle.net/10945/7113
https://hdl.handle.net/10945/7113
Large complex systems need to be analyzed prior to operation so that those depending upon them for the protection of their information have a well-defined understanding of the measures that have been taken to achieve security and the residual risk th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2778::fd3d0e923f0600090407039f099d07ba
https://hdl.handle.net/10945/7112
https://hdl.handle.net/10945/7112
Autor:
Rasmussen, Craig W., Carroll, Thomas
The chordal graphs have been well-studied because of their desirable algorithmic characteristics. Many problems that are intractable in the general case are solvable by fast algorithms in the chordal case. We show that the chordal graphs are partiall
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2778::10b78aebfe08f8e1a1a1883bf9843bf3
https://hdl.handle.net/10945/15329
https://hdl.handle.net/10945/15329
Autor:
Langley, Larry, Lundgren, J. Richard, McKenna, Patricia A., Merz, Sarah K., Rasmussen, Craig W.
Competition graphs were first introduced by Joel Cohen in the study of food webs and have been since extensively studied. Graphs which are the competition graph of a strongly connected or Hamiltonian digraph are of particular interest in applications
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2778::162a3f28bdb2713ccb6bb33695a3d034
https://hdl.handle.net/10945/45524
https://hdl.handle.net/10945/45524
Autor:
Rasmussen, Craig W.
http://archive.org/details/conditionalgraph00rasm NA
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2778::7bbae9c01dac17ae5889592689e2ce28
https://hdl.handle.net/10945/28703
https://hdl.handle.net/10945/28703
Previous work on competition graphs has emphasized characterization, not only of the competition graphs themselves but also of those graphs whose competition graphs are chordal or interval. The latter sort of characterization is of interest when a co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2778::76861ad7a5eca9a98be99343b555eef7
https://hdl.handle.net/10945/28696
https://hdl.handle.net/10945/28696
One of the intriguing open problems on competition graphs is determining what digraphs have interval competition graphs. In this paper we consider this problem for the class of loopless symmetric digraphs. Here we first consider forbidden subgraph ch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2778::57b06c256e6c0a40c637ada34933c67d
https://hdl.handle.net/10945/28695
https://hdl.handle.net/10945/28695