Filters
total: 2307
filtered: 1518
-
Catalog
Chosen catalog filters
displaying 1000 best results Help
Search results for: STRONG PRODUCT GRAPHS
-
The maximum edge-disjoint paths problem in complete graphs
PublicationRozważono problem ścieżek krawędziowo rozłącznych w grafach pełnych. Zaproponowano wielomianowe algorytmy: 3.75-przybliżony (off-line) oraz 6.47-przybliżony (on-line), poprawiając tym samym wyniki wcześniej znane z literatury [P. Carmi, T. Erlebach, Y. Okamoto, Greedy edge-disjoint paths in complete graphs, in: Proc. 29th Workshop on Graph Theoretic Concepts in Computer Science, in: LNCS, vol. 2880, 2003, pp. 143-155]. Ponadto...
-
On the deficiency of bipartite graphs
Publication -
Named Property Graphs
Publication -
Serialization for Property Graphs
Publication -
Rank Coloring of Graphs.
PublicationRozdział jest poświęcony uporządkowanemu kolorowaniu grafów. Przedstawiono jego podstawowe własności oraz zastosowania praktyczne.
-
Circular colorings of graphs.
PublicationRozdział poświęcony jest cyrkularnemu modelowi kolorowania krawędzi. Rozważana jest zarówno wersja wierzchołkowa i krawędziowa. Szczególny nacisk położono na złożoność obliczeniową i zastosowania dla omawianych modeli kolorowania.
-
Harmonions Coloring of Graphs.
PublicationProblem kolorowania grafów jest motywowany radionawigacją lotniczą, kompresją obrazów i in. W rozdziale podano podstawowe fakty dotyczące tego modelu kolorowania, a wsród nich dolne i górne oszacowania na liczbę harmoniczną i algorytm o złożoności 0 (mm3) dający bardzo dobre pokolorowania przybliżone.
-
T-coloring of graphs.
PublicationNiniejszy rozdział omawia kontrastowe kolorowanie grafów. Podana została jego definicja i podstawowe własności, zastosowania oraz złożoność obliczeniowa problemów rozważanych w ramach tej dziedziny.
-
Classical coloring of graphs.
PublicationRozdział obejmuje klasyczne kolorowanie krawędzi i wierzołków w grafach prostych. Oprócz podstawowych definicji podane zostały najczęściej stosowane metody przybliżone oraz ich właściwości. Dodatkowo rozdział zawiera przegląd znanych benczmarków dla podanych metod w kontekście klasycznego modelu kolorowania.
-
Sum Coloring of Graphs.
PublicationRozdział jest poświęcony sumacyjnemu kolorowaniu grafów. Przedstawiono jego podstawowe własności oraz zastosowania praktyczne.
-
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
PublicationIn the paper we consider the problems of equitable and semi-equitable coloring of vertices of cubic graphs. We show that in contrast to the equitable coloring, which is easy, the problem of semi-equitable coloring is NP- complete within a broad spectrum of graph parameters. This affects the complexity of batch scheduling of unit-length jobs with cubic incompatibility graph on three uniform processors to minimize...
-
On iterates of strong Feller operators on ordered phase spaces.
PublicationPraca dotyczy asymptotycznych własności iteracji operatorów Markowa. Udowodniono, że operatory Lasoty i ich wielowymiarowe uogólnienia są asymptotycznie stabilne. Wyniki mają zastosowanie w modelowaniu rozwoju komórki.
-
A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4
PublicationIn the note we consider vertex coloring of a graph in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of coloring is the sum of costs incurred at each vertex. We show that the minimum cost coloring problem for n-vertex bipartite graph of degree ∆≤4 can be solved in O(n^2) time. This extends Jansen’s result [K.Jansen,The optimum cost chromatic partition problem, in:...
-
Brand loyalty creation in the social network. Does the product category matter?
PublicationThe final goal of all marketers’ effort is to achieve a high level of loyalty toward their brands. Social network brand sites are increasingly attracting the attention of scientists and managers intrigued by their potential application for brand loyalty creation. The aim of this research, based on European sample, is to fill the gap in understanding the product category loyalty and brand loyalty relation as an output of brand identification...
-
Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs
PublicationWe study the problem of rendezvous of two mobile agents starting at distinct locations in an unknown graph. The agents have distinct labels and walk in synchronous steps. However the graph is unlabelled and the agents have no means of marking the nodes of the graph and cannot communicate with or see each other until they meet at a node. When the graph is very large we want the time to rendezvous to be independent of the graph size...
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublicationLet G = (V,E) be a graph without an isolated vertex. A set D ⊆ V (G) is a total dominating set if D is dominating and the in- duced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total domi- nating set of G. A set D ⊆ V (G) is a total outer–connected dominating set if D is total dominating and the induced subgraph G[V (G)−D] is a connected graph. The total outer–connected...
-
Global Product as a Result of Globalization Process
Publication -
Relative product diversification in the course of economic development: import-export analysis.
PublicationThis paper contributes to trade diversification literature by comparing changes in relative (i.e. assessed in comparison with world patterns) heterogeneity of import and export structures in the process of economic development. In particular, by focusing on the diversification of imports, we add a missing piece to already analysed export trends. We use highly disaggregated trade statistics (4963 product lines) for 163 countries...
-
GROUPS OF GERMAN DOMESTIC APPLIANCE MANUFACTURERS ACCORDING TO NEW PRODUCT DEVELOPMENT PRACTICES
PublicationFinding the best way to develop new products has been always a hot topic for practitioners and academics. However, so far only a few of these kinds of studies have concentrated on a single industry. In this paper, we group German domestic appliance manufacturers with regards to their new product development (NPD) practices to discover their attitude to NPD effort. By conducting a survey we found that three different groups of manufacturers...
-
Nonlinear strain gradient and micromorphic one-dimensional elastic continua: Comparison through strong ellipticity conditions
PublicationWe discuss the strong ellipticity (SE) conditions for strain gradient and micromorphic continua considering them as an enhancement of a simple nonlinearly elastic material called in the following primary material. Recently both models are widely used for description of material behavior of beam-lattice metamaterials which may possess various types of material instabilities. We analyze how a possible loss of SE results in the behavior...
-
Kinetics and mechanism of the dehydrohalogenation of Ar2CHCX3 and Ar2CHCHX2 by strong N-bases
Publication -
Strong-coupling character of superconducting phase in compressed selenium hydride
Publication -
Strong Monogamies of No-Signaling Violations for Bipartite Correlation Bell Inequalities
PublicationThe phenomenon of monogamy of Bell inequality violations is interesting both from the fundamental perspective as well as in cryptographic applications such as the extraction of randomness and secret bits. In this article, we derive new and stronger monogamy relations for violations of Bell inequalities in general no-signaling theories. These relations are applicable to the class of binary output correlation inequalities known as...
-
Interval Edge-Coloring of Graphs
Publication -
Greedy T-colorings of graphs
PublicationTreścią artykułu są pokolorowania kontrastowe wygenerowane przez algorytm zachłanny. Zbadane zostały ich własności, obejmujące liczbę kolororów, rozpiętość i rozpiętość krawędziową.
-
Super Dominating Sets in Graphs
PublicationIn this paper some results on the super domination number are obtained. We prove that if T is a tree with at least three vertices, then n2≤γsp(T)≤n−s, where s is the number of support vertices in T and we characterize the extremal trees.
-
Total restrained bondage in graphs
PublicationPodzbiór D zbioru wierzchołków grafu nazywamy zewnętrznie totalnym dominującym w grafie, jeśli każdy wierzchołek spoza D ma sąsiada zarówno w D jak i poza D. Moc najmniejszego zbioru o tej własności nazywamy liczbą dominowania zewnętrznie totalnego. W artykule badamy wpływ usuwania krawędzi na liczbę dominowania zewnętrznie totalnego, czyli liczbę zewnętrznego totalnego zniewolenie w grafach.
-
On efficient coloring of chordless graphs
PublicationArtykuł omawia zagadnienie optymalnego, wielomianowego rozpoznawania i kolorowania grafów bezcięciwowych. Zawiera dowód tego, że takie grafy są zawsze 4-kolorowalne oraz opis wielomianowego algorytmu, który koloruje je minimalną możliwą liczbą kolorów.
-
Correction to: Serialization for Property Graphs
Publication -
Interval edge-coloring of graphs.
PublicationRozdział poświęcony prezentacji modelu zwartego kolorowania krawędziowego grafów i jego znanych własności. Szczególny nacisk położono na opis klas grafów dających się pokolorować zwarcie w czasie wielomianowym. Omówiono także stratność jako miarę niepodatności grafu na kolorowanie zwarte.
-
Path Coloring and Routing in Graphs.
PublicationW rozdziale omówione zostały problemy kolorowania ścieżek i routingu w grafach. Podano podstawowe definicje związane z tymi problemami, znane wyniki wraz z dyskusją złożoności obliczeniowej dla grafów ogólnych i dla kilku podstawowych klas grafów oraz zastosowania.
-
Equitable vertex coloring of graphs
PublicationW pracy podajemy wartości sprawiedliwej liczby chromatycznej dla niektórych klas grafów. Podajemy również dwa algorytmy heurystyczne dla sprawiedliwego kolorowania grafów z suboptymalna liczba koloru.
-
A Model of Thermal Energy Storage According to the Convention of Bond Graphs (BG) and State Equations (SE)
PublicationThe main advantage of the use of the Bond Graphs method and State Equations for modeling energy systems with a complex structure (marine power plants, hybrid vehicles, etc.) is the ability to model the system components of different physical nature using identical theoretical basis. The paper presents a method of modeling thermal energy storage, which is in line with basic BG theory. Critical comments have been put forward concerning...
-
Noncentrosymmetric Triangular Magnet CaMnTeO6: Strong Quantum Fluctuations and Role of s0 versus s2 Electronic States in Competing Exchange Interactions
PublicationNoncentrosymmetric triangular magnets offer a unique platform for realizing strong quantum fluctuations. However, designing these quantum materials remains an open challenge attributable to a knowledge gap in the tunability of competing exchange interactions at the atomic level. Here, a new noncentrosymmetric triangular S = 3/2 magnet CaMnTeO6 is created based on careful chemical and physical considerations. The model material...
-
Superconducting SrSnP with Strong Sn–P Antibonding Interaction: Is the Sn Atom Single or Mixed Valent?
PublicationThe large single crystals of SrSnP were prepared using Sn self-flux method. The superconductivity in the tetragonal SrSnP is observed with the critical temperature of ∼2.3 K. The results of a crystallographic analysis, superconducting characterization, and theoretical assessment of tetragonal SrSnP are presented. The SrSnP crystallizes in the CaGaN structure type with space group P4/nmm (S.G. 129, Pearson symbol tP6) according...
-
Performance of the Direct Sequence Spread Spectrum Underwater Acoustic Communication System with Differential Detection in Strong Multipath Propagation Conditions
PublicationThe underwater acoustic communication (UAC) operating in very shallow-water should ensure reliable transmission in conditions of strong multipath propagation, significantly disturbing the received signal. One of the techniques to achieve this goal is the direct sequence spread spectrum (DSSS) technique, which consists in binary phase shift keying (BPSK) according to a pseudo-random spreading sequence. This paper describes the DSSS...
-
Characterizing the Performance of <span class="sc">xor</span> Games and the Shannon Capacity of Graphs
PublicationIn this Letter we give a set of necessary and sufficient conditions such that quantum players of a two-party xor game cannot perform any better than classical players. With any such game, we associate a graph and examine its zero-error communication capacity. This allows us to specify a broad new class of graphs for which the Shannon capacity can be calculated. The conditions also enable the parametrization of new families of games...
-
Negative result about the construction of genuinely entangled subspaces from unextendible product bases
PublicationUnextendible product bases (UPBs) provide a versatile tool with various applications across different areas of quantum information theory. Their comprehensive characterization is thus of great importance and has been a subject of vital interest for over two decades now. An open question asks about the existence of UPBs, which are genuinely unextendible, i.e., they are not extendible even with biproduct vectors. In other words,...
-
Pesticide analysis of bee and bee product samples
PublicationBee products possess therapeutic properties and are the source of many essential trace elements,which is why they are regarded as valuable food products. Honey bees may bring to thehive numerous contaminants deposited on the plants they visit, including pesticide withoutxenobiotics. The large-scale application of pesticides in agriculture and horticulture can lead tomass mortality among bees, and the chemicals find their way into...
-
Pesticide Analysis of Bee and Bee Product Samples
PublicationBee products possess therapeutic properties and are the source of many essential trace elements,which is why they are regarded as valuable food products. Honey bees may bring to thehive numerous contaminants deposited on the plants they visit, including pesticide withoutxenobiotics. The large-scale application of pesticides in agriculture and horticulture can lead tomass mortality among bees, and the chemicals find their way into...
-
Natural Hydroxyapatite as a by-product of industrial biomass gasification
Publication.
-
Smart Innovation Engineering (SIE): Experience-Based Product Innovation System for Industry 4.0
PublicationThis paper presents a semi-automatic system capable of facilitating product innovation process. This system, known as Smart Innovation Engineering (SIE) system, helps in decision-making by using the explicit knowledge of formal decision events. The SIE system carries the promise to support the innovation processes of manufactured products in a quick and efficient way. It stores and reuses the past decisional events or sets of experiences...
-
Stimulation of Heavy Metal Adsorption Process by Using a Strong Magnetic Field
Publication -
Modelling the Safety Levels of ICT Equipment Exposed to Strong Electromagnetic Pulses
Publication -
City as a product. Architecture as an Economic Instrument. Are Global Cities People-Friendly Places?
PublicationWhile spending time in our everyday urban environment do we ever think how particular architecture influences the economic value of that space? Space has its measurable financial value. From the economic point of view a place can be treated as a product that fights for appearing in tourists’ and investors’ consciousnesses. Space - treated as an object of demand and supply - becomes an element in a marketing game. To reach its...
-
Consecutive colorings of the edges of general graphs
Publication -
Distance paired domination numbers of graphs
PublicationW pracy przedstawione są pewne własności liczb k-dominowania parami w grafach. Wykazane jest, że problem decyzyjny liczby k-dominowania parami jest problemem NP-zupełnym nawet dla grafów dwudzielnych. Przedstawione są ograniczenia górne i dolne dla liczby k-dominowania parami w drzewach i scharakteryzowane drzewa, w których te ograniczenia są osiągnięte.
-
Paired domination and doubly domination in graphs
PublicationW rozprawie poruszane są zagadnienia związane z dominowaniem parami w grafach oraz domiowaniem totalno - powściągniętym w grafach. Ponadto omawiane są zagadnienia związane ze złożonością obliczeniową różnych problemów dominowania w grafach.
-
Weakly connected domination critical graphs
PublicationPraca dotyczy niektórych klas grafów krytycznych ze względu na liczbę dominowania słabo spójnego.
-
The complexity of equitable vertex coloring graphs
PublicationW artykule podajemy wzory na sprawiedliwą liczbę chromatyczną niektórych produktów grafowych. Ponadto przedstawiamy dwa algorytmy wielomianowe dla sprawiedliwego kolorowania grafów suboptymalną liczba kolorów.