Filters
total: 1327
displaying 1000 best results Help
Search results for: EDGE COLORING
-
Approximation strategies for routing edge disjoint paths in complete graphs
PublicationPraca dotyczy problemu ścieżek krawędziowo rozłącznych w nieskierowanych grafach pełnych, dla którego podano nowe algorytmy przybliżone: 3.75-przybliżony (model off-line) i 6.47-przybliżony (model on-line). Stosując podobną metodologię, uzyskano algorytm 4.5-przybliżony (off-line) i 6-przybliżony (on-line) dla problemu routingu i kolorowania ścieżek w grafach pełnych.
-
Approximating the maximum 2- and 3-edge-colorable subgraph problems
PublicationDla ustalonej wartości parametru k>=2, problem maksymalnego podgrafu krawędziowo k-kolorowalnego polega na wskazaniu k rozłącznych skojarzeń w grafie prostym, a kryterium optymalizacji jest maksymalizacja całkowitej liczby użytych krawędzi. W pracy podano algorytmy 5/6- i 4/5-przybliżone odpowiednio dla przypadków k=2 i k=3, poprawiając wyniki znane z literatury.
-
On the approximation of the UWB dipole elliptical arms with stepped-edge polygon
PublicationA simple method of approximation of the ellipticalpatch with stepped-edge polygon is proposed as an introductionto wider studies over the planar ultrawideband (UWB) antennas.The general idea is to replace the elliptical patch with an equivalentpolygonal patch, with minimum loss in the performance. Theprinciples of the proposed method are presented in this letter, aswell as the results of performed numerical studies and its experimentalverification....
-
A Method and Device for 3D Recognition of Cutting Edge Micro Geometry
PublicationA very useful method was successfully applied in the investigation of tools for machining wood and wood based composites. It allows scanning of the cutting edge micro geometry in three dimensions and reproducing it in a virtual space as a 3D surface. The application of the method opens new possibilities of studying tool wear by scanning, including the calculation of volume loss and other analysis of tool wedge geometry along and...
-
Investigation on the edge forces in ball end milling of inclined surfaces
Publication -
Tuning the work function of graphite nanoparticles via edge termination
PublicationGraphite nanoparticles are important in energy materials applications such as lithium-ion batteries (LIBs), supercapacitors and as catalyst supports. Tuning the work function of the nanoparticles allows local control of lithiation behaviour in LIBs, and the potential of zero charge of electrocatalysts and supercapacitors. Using large scale density functional theory (DFT) calculations, we find that the surface termination of multilayer...
-
CLONING AND STEM CELLS
Journals -
Colorings of the Strong Product of Circulant Graphs
PublicationGraph coloring is one of the famous problems in graph theory and it has many applications to information theory. In the paper we present colorings of the strong product of several circulant graphs.
-
Self-stabilizing algorithms for graph coloring with improved performance guarantees
PublicationW pracy rozważa się rozproszony model obliczeń, w którym struktura systemu jest reprezentowana przez graf bezpośrednich połączeń komunikacyjnych. W tym modelu podajemy nowy samostabilizujący algorytm kolorowania grafów oparty na konstrukcji drzewa spinającego. Zgodnie z naszą wiedzą jest to pierwszy algorytm z gwarantowaną wielomianową liczbą ruchów, który dokładnie koloruje grafy dwudzielne.
-
A 27/26-approximation algorithm for the chromatic sum coloring of bipartitegraphs
PublicationWe consider the CHROMATIC SUM PROBLEM on bipartite graphs which appears to be much harder than the classical CHROMATIC NUMBER PROBLEM. We prove that the CHROMATIC SUM PROBLEM is NP-complete on planar bipartite graphs with Delta less than or equal to 5, but polynomial on bipartite graphs with Delta less than or equal to 3, for which we construct an O(n(2))-time algorithm. Hence, we tighten the borderline of intractability for this...
-
Deep Learning Optimization for Edge Devices: Analysis of Training Quantization Parameters
PublicationThis paper focuses on convolution neural network quantization problem. The quantization has a distinct stage of data conversion from floating-point into integer-point numbers. In general, the process of quantization is associated with the reduction of the matrix dimension via limited precision of the numbers. However, the training and inference stages of deep learning neural network are limited by the space of the memory and a...
-
An O ( n log n ) algorithm for finding edge span of cacti
PublicationLet G=(V,E) be a nonempty graph and xi be a function. In the paper we study the computational complexity of the problem of finding vertex colorings c of G such that: (1) |c(u)-c(v)|>=xi(uv) for each edge uv of E; (2) the edge span of c, i.e. max{|c(u)-c(v)|: uv belongs to E}, is minimal. We show that the problem is NP-hard for subcubic outerplanar graphs of a very simple structure (similar to cycles) and polynomially solvable for...
-
Novel Analytic-Numerical Model of Free Convection: with Leading Edge Considered
PublicationA novel solution of the free convection boundary problem is represented in analytical form for velocity and temperature for an isothermal vertical plate, as an example. These fields are built as a Taylor Series in the x coordinate with coefficients as functions of the vertical coordinate (y). We restrict ourselves by cubic approximation for both functions. The basic Navier-Stokes and Fourier-Kirchhoff equations and boundary conditions...
-
T-colorings, divisibility and circular chromatic number
PublicationLet T be a T-set, i.e., a finite set of nonnegative integers satisfying 0 ∈ T, and G be a graph. In the paper we study relations between the T-edge spans espT (G) and espd⊙T (G), where d is a positive integer and d ⊙ T = {0 ≤ t ≤ d (max T + 1): d |t ⇒ t/d ∈ T} . We show that espd⊙T (G) = d espT (G) − r, where r, 0 ≤ r ≤ d − 1, is an integer that depends on T and G. Next we focus on the case T = {0} and show that espd⊙{0} (G) =...
-
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs
PublicationWe consider the complexity of semi-equitable k-coloring, k>3, of the vertices of a cubic or subcubic graph G. In particular, we show that, given a n-vertex subcubic graph G, it is NP-complete to obtain a semi-equitable k-coloring of G whose non-equitable color class is of size s if s>n/3, and it is polynomially solvable if s, n/3.
-
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:...
-
Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
Publication -
Scheduling with precedence constraints: mixed graph coloring in series-parallel graphs.
PublicationW pracy rozważono problem kolorowania grafów mieszanych, opisujący zagadnienie szeregowania zadań, w którym zależności czasowe zadań mają charakter częściowego porządku lub wzajemnego wykluczania. Dla przypadku, w którym graf zależności jest szeregowo-równoległy, podano algorytm rozwiązujący problem optymalnie w czasie $O(n^3.376 * log n)$.
-
Computer experiments with a parallel clonal selection algorithm for the graph coloring problem
PublicationArtificial immune systems (AIS) are algorithms that are based on the structure and mechanisms of the vertebrate immune system. Clonal selection is a process that allows lymphocytes to launch a quick response to known pathogens and to adapt to new, previously unencountered ones. This paper presents a parallel island model algorithm based on the clonal selection principles for solving the Graph Coloring Problem. The performance of...
-
The computational complexity of the backbone coloring problem for planar graphs with connected backbones
PublicationIn the paper we study the computational complexity of the backbone coloring problem for planar graphs with connected backbones. For every possible value of integer parameters λ≥2 and k≥1 we show that the following problem: Instance: A simple planar graph GG, its connected spanning subgraph (backbone) HH. Question: Is there a λ-backbone coloring c of G with backbone H such that maxc(V(G))≤k? is either NP-complete or polynomially...
-
Sharp bounds for the complexity of semi-equitable coloring of cubic and subcubic graphs
PublicationIn this paper we consider the complexity of semi-equitable k-coloring of the vertices of a cubic or subcubic graph. We show that, given n-vertex subcubic graph G, a semi-equitable k-coloring of G is NP-hard if s >= 7n/20 and polynomially solvable if s <= 7n/21, where s is the size of maximum color class of the coloring.
-
Equitable coloring of graphs. Recent theoretical results and new practical algorithms
PublicationIn this paper we survey recent theoretical results concerning conditions for equitable colorability of some graphs and recent theoretical results concerning the complexity of equitable coloring problem. Next, since the general coloring problem is strongly NP-hard, we report on practical experiments with some efficient polynomial-time algorithms for approximate equitable coloring of general graphs.
-
On Optimal Backbone Coloring of Split and Threshold Graphs with Pairwise Disjoint Stars
Publication -
Some Artificial Intelligence Driven Algorithms For Mobile Edge Computing in Smart City
PublicationSmart mobile devices can share computing workload with the computer cloud that is important when artificial intelligence tools support computer systems in a smart city. This concept brings computing on the edge of the cloud, closer to citizens and it can shorten latency. Edge computing removes a crucial drawback of the smart city computing because city services are usually far away from citizens, physically. Besides, we introduced...
-
The Taste of Waste: The Edge of Eggshell Over Calcium Carbonate in Acrylonitrile Butadiene Rubber
PublicationRubber technology experiences a new age by the use of biowaste or natural fillers. In this regard, taking properties of reinforcing agents from biowaste fillers remains as the challenging matter. Chicken eggshell (ES) biowaste has recently been introduced to substitute calcium carbonate (CaCO3) duo to its superior properties and low price. In this work, composites based on acrylonitrile butadiene rubber (NBR) reinforced with ES...
-
How to teach architecture? – Remarks on the edge of Polish transformation processes after 1989
PublicationThe political changes in Poland after 1989 have resulted in a whole range of dynamic processes including the transformation of space. Until that time the established institutional framework for spatial, urban and architectural planning policy was based on uniform provisions of the so-called planned economy. The same applied to the training of architects, which was based on a unified profile of education provided at the state’s...
-
Automatic Detection of Nerves in Confocal Corneal Images with Orientation-Based Edge Merging
PublicationThe paper presents an algorithm for improving results of automatic nerve detections in confocal microscopy images of human corneal. The method is designed as a postprocessing step of regular detection. After the nerves are initially detected, the algorithms attempts to improve the results by filling unde-sired gaps between single nerves detections in order to correctly mark the entire nerve instead of only parts of it. This approach...
-
Edge-Guided Mode Performance and Applications in Nonreciprocal Millimeter-Wave Gyroelectric Components
PublicationThe analogies between the behavior of gyromagnetic and gyroelectric nonreciprocal structures, the use of the simple transfer matrix approach, and the edge-guided (EG) wave property, supported in a parallel plate model for integrated magnetized semiconductor waveguide, are investigated in those frequency regions, where the effective permittivity is negative or positive. As with their ferrite counterparts, the leakage of the EG waves...
-
CNN-CLFFA: Support Mobile Edge Computing in Transportation Cyber Physical System
PublicationIn the present scenario, the transportation Cyber Physical System (CPS) improves the reliability and efficiency of the transportation systems by enhancing the interactions between the physical and cyber systems. With the provision of better storage ability and enhanced computing, cloud computing extends transportation CPS in Mobile Edge Computing (MEC). By inspecting the existing literatures, the cloud computing cannot fulfill...
-
The XAS spectra of O-K edges, M-L edges and Ce-M edges in Ce0.9M0.1O2
Open Research DataThe dataset consists of XAS spectra of O-K edges, M-L edges of Ce0.9M0.1O2 (where M=Mn, Fe, Co, Ni, Cu) synthesised by reverse microemulsion method. XAS spectra were collected at PIRX beamline in SOLARIS National Synchrotron Radiation Centre. Measurements were perfomed under ultra high vacuum in total electron yield (TEY) mode.
-
EGE ACADEMIC REVIEW
Journals -
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
Publication -
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
PublicationWe address a generalization of the classical 1- and 2-processor unit execution time scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous availability times and tasks have arbitrary release times and due dates. Also, the versatility of our approach makes it possible to generalize all known classical criteria of optimality. Under these stipulations we show that the problem...
-
A note on fast approximate backbone coloring of split graphs with star--like backbones
PublicationDla grafu G = (V, E) z wyróżnionym podgrafem H, kolorowanie szkieletowe jest zdefiniowane jako odwzorowanie c spełniające |c(u) - c(v)| > 1 dla każdej krawędzi z E(H) oraz |c(u) - c(v)| > 0 dla każdej krawędzi z E(G). W pracy przedstawiono 1-przybliżony algorytm kolorowania szkieletowego split grafów ze skojarzeniem w szkielecie o złożoności O(|V|) oraz 1-przybliżony algorytm dla split grafów z rozłącznymi gwiazdami w szkielecie.
-
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...
-
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones
PublicationGiven a graph G, a spanning subgraph H of G and an integer λ>=2, a λ-backbone coloring of G with backbone H is a vertex coloring of G using colors 1, 2, ..., in which the color difference between vertices adjacent in H is greater than or equal to lambda. The backbone coloring problem is to find such a coloring with maximum color that does not exceed a given limit k. In this paper, we study the backbone coloring problem for bounded-degree...
-
Consensus models: Computational complexity aspects in modern approaches to the list coloring problem
PublicationArtykuł poświęcony jest nowym modelom konsensusowego kolorowania grafów. Artykuł zawiera omówienie trzech takich modeli, analizę ich złożoności obliczeniowej oraz wielomianowy algorytm dla częściowych k-drzew, dla tzw. modelu addytywnego.
-
Some results concerning the complexity of restricted colorings of graphs
Publication -
Adhesive Monitoring with Instrumented Wedge Test
PublicationThe wedge test (sometimes called the Boeing wedge test) is amongst the most readily exploitable techniques for assessment of the rate-dependent fracture energy of adhesive materials when used to bond relatively rigid substrates. With its siblings: the double cantilever beam (DCB), and the tapered double cantilever beam (TDCB), a force is applied, essentially in cleavage, to provoke substrate separation perpendicularly to the bondline...
-
Equitable colorings of some variation of corona products of cubic graphs
PublicationThe problem of determining the value of equitable chromatic number for multicoronas of cubic graphs is studied. We provide some polynomially solvable cases of cubical multicoronas and give simple linear time algorithms for equitable coloring of such graphs which use almost optimal number of colors in the remaining cases.
-
Dataset of non-isomorphic graphs being coloring types (K5-e,Km-e;n), 2<m<5, 1<n<R(K5-e,Km-e)
Open Research DataFor K5-e and Km-e graphs, the type coloring (K5-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K5-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K5-e,Km-e) is the smallest...
-
Dataset of non-isomorphic graphs being coloring types (K6-e,Km-e;n), 2<m<5, 1<n<R(K6-e,Km-e)
Open Research DataFor K6-e and Km-e graphs, the type coloring (K6-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K6-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed. The Ramsey number R(K6-e,Km-e) is the smallest...
-
Fully Separated Flow Control Using DBD Plasma Actuators Located at the Leading Edge of an Airfoil
PublicationIn the framework of the PLASMAERO European project, experiments were conducted to investigate the authority of surface DBD plasma actuators to alter a fully separated flow around an airfoil in order to improve its aerodynamic performances in its natural stall regime. In this paper, unsteady excitation control is more specifically investigated. The key control parameter studied here is the burst frequency which periodically imposes...
-
Local Structure and Stability of SEI in Graphite and ZFO Electrodes Probed by As K-edge Absorption Spectroscopy
PublicationThe evolution of the solid electrolyte interphase (SEI) during the first Li uptake in advanced Li-ion electrodes is studied by X-ray absorption spectroscopy (XAS). The As atoms present in the electrolyte solution were used as a local probe for monitoring the SEI growth on different electrodes. High-quality As K-edge spectra were collected in fluorescence mode for a set of graphite and carbon-coated ZnFe2O4 electrodes. XAS measurements...
-
Dataset of non-isomorphic graphs being coloring types (K4-e,Km-e;n), 2<m<7, 1<n<R(K4-e,Km-e)
Open Research DataFor K4-e and Km-e graphs, the type coloring (K4-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K4-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K4-e,Km-e) is the smallest...
-
Dataset of non-isomorphic graphs being coloring types (K3-e,Km-e;n), 2<m<8, 1<n<R(K3-e,Km-e)
Open Research DataFor K3-e and Km-e graphs, the type coloring (K3-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K3-e,Km-e) is the smallest...
-
Marek Kubale prof. dr hab. inż.
PeopleDetails concerning: Qualifications, Experiences, Editorial boards, Ph.D. theses supervised, Books, and Recent articles can be found at http://eti.pg.edu.pl/katedra-algorytmow-i-modelowania-systemow/Marek_KubaleGoogle ScholarSylwetka prof. Marka Kubalego Prof. Marek Kubale pracuje na Wydziale ETI Politechniki Gdańskiej nieprzerwanie od roku 1969. W tym czasie napisał ponad 150 prac naukowych, w tym ponad 40 z listy JCR. Ponadto...
-
Microstrip line with short-circuited edge as a high-pass filter operating up to millimeter-wave frequencies
PublicationPrzedstawiono prosty planarny filtr górnoprzepustowy wykorzystujący linię mikropaskową ze zwartym brzegiem. Układy zaprojektowano w taki sposób, aby pasmo przepustowe rozpoczynało się w zakresie K lub Ka. Wykonano dwa prototypy: na podłożu w postaci warstwy dielektrycznej wykonanej z ceramiki alundowej oraz na podłożu organicznym o niskiej przenikalności elektrycznej. Wykazano dużą zgodność teoretycznych i pomierzonych charakterystyk...
-
Trailing-Edge Separation Control of a NACA 0015 Airfoil Using Dielectric-Barrier-Discharge Plasma Actuators
PublicationThis paper presents a part of the works conducted in the Plasmaero European project (task 3.1), where the trailing-edge flow separation of a NACA 0015 airfoil has been controlled using four different dielectric barrier discharge (DBD) actuator types at three institutions across Europe. The results show that it is possible to enhance the aerodynamic performance of aircraft at speeds up to 40 m/s. Dielectric-barrier-discharge vortex...
-
A study of optical properties and annealing effect on the absorption edge of pristine- and iodine-doped polyazomethine thin films
Publication