Search
Filters
total: 1633
-
Catalog
displaying 1000 best results Help
Search results for: SPLIT GRAPHS
-
Bond-graphs based modelling of hybrid energy systems with permanent magnet brushless machines
PublicationW referacie przedstawiono metodę grafów wiązań (GW) w zastosowaniu do modelowania hybrydowych systemów energetycznych z bezszczotkowymi maszynami elektrycznymi o magnesach trwałych. W części pierwszej referatu omówiono ogólne formalizm GW. Następnie przedstawiono kolejno: ogólną strukturę modelu hybrydowego systemu energetycznego w ujęciu GW; założenia modelowania maszyn elektrycznych w ujęciu GW, model silnika bezszczotkowego...
-
Bond-graphs based modelling of hybrid energy systems with permanent magnet brushless machines
PublicationW referacie przedstawiono metodę grafów wiązań (GW) w zastosowaniu do modelowania hybrydowych systemów energetycznych z bezszczotkowymi maszynami elektrycznymi o magnesach trwałych. W części pierwszej referatu omówiono ogólne formalizm GW. Następnie przedstawiono kolejno: ogólną strukturę modelu hybrydowego systemu energetycznego w ujęciu GW; założenia modelowania maszyn elektrycznych w ujęciu GW, model silnika bezszczotkowego...
-
The complexity of the L(p,q)-labeling problem for bipartite planar graphs of small degree
PublicationW pracy pokazano, że problem L(p,q)-kolorowania przy użyciu ''t'' kolorów jest NP-zupełny nawet w wersji ograniczonej do grafów planarnych dwudzielnych małego stopnia, nawet dla stosunkowo niewielkich wartości ''t''. Jako wniosek z uzyskanych wyników stwierdzono, że problem L(2,1)-kolorowania grafów planarnych przy użyciu 4 kolorów jest NP-zupełny, a także że problem L(p,q)-kolorowania grafów o maksymalnym stopniu 4 jest NP-zupełny...
-
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...
-
Bond-graphs based modelling of hybrid energy systems with permanent magnet brushless machines
PublicationW referacie przedstawiono metodę grafów wiązań (GW) w zastosowaniu do modelowania hybrydowych systemów energetycznych z bezszczotkowymi maszynami o magnesach trwałych (BMMT). W części pierwszej referatu omówiono ogólne formalizm GW. Następnie przedstawiono kolejno: ogólną strukturę modelu hybrydowego systemu energetycznego w ujęciu GW; założenia modelowania maszyn elektrycznych w ujęciu GW, model SBMT w ujęciu GW dla potrzeb modelowania...
-
A better practical algorithm for distributed graph coloring
Publication -
Interval vertex-coloring of a graph with forbidden colors
Publication -
Interval Vertex-Coloring of a Graph With Forbidden Colors
Publication -
The smallest hard-to-color graph for algorithm DSATUR
Publication -
Interval edge coloring of a graph with forbidden colors
Publication -
The smallest hard-to-color graph for the SL algorithm
Publication -
Distributed largest-first algorithm for graph coloring.
PublicationW artykule zaprezentowano rozproszony, probabilistyczny algorytm kolorowania grafów. Kolorowanie uzyskane jest optymalne lub prawie optymalne dla takich klas grafów jak koła dwudzielne, gąsienice czy korony. Udowodniono, że algorytm ten działa w czasie O(D^2 log n) rund dla dowolnego grafu n wierzchołkowegoo stopniu maksymalnym D.
-
An experimental study of distributed algorithms for graph coloring.
PublicationW pracy podano algorytm rozproszonego kolorowania grafówi porównano ze znanym wcześniej algorytmem.
-
Packing three-vertex paths in a subcubic graph
PublicationW pracy rozważany jest problem pakowania scieżek P3 w grafach podkubicznych, pokazano oszacowania dolne na ilość ścieżek w zależności od stopnia spójności grafu oraz minimalnego stopnia.
-
Graph decomposition for improving memoryless periodic exploration
PublicationW ostatnich latach często badanym problem jest eksploracja anonimowych grafów z lokalnymi etykietami portów przy każdym wierzchołku. Niedawno pokazano [Czyzowicz et al., Proc. SIROCCO'09], że dla każdego grafu istnieje poetykietowanie prowadzące do eksploracji przez automat bezpamięciowy z okresem co najwyżej 13n/3. W niniejszej pracy poprawiamy to ograniczenie do 4n-2, stosując całkowicie nową technikę dekompozycji grafu.
-
Graph Approach to the Computation of the Homology of Continuous Maps
Publication -
Product Graph Invariants with Applications in the Theory of Information
PublicationThere are a large number of graph invariants. In the paper, we consider some of them, e.g. the independence and chromatic numbers. It is well know that we cannot efficiently calculate these numbers for arbitrary graphs. In the paper we present relations between these invariants and concepts from the theory of information. Concepts such as source coding and transmission over a noisy channel with zero probability of error are modeled...
-
Parallel tabu search for graph coloring problem
PublicationTabu search is a simple, yet powerful meta-heuristic based on local search that has been often used to solve combinatorial optimization problems like the graph coloring problem. This paper presents current taxonomy of patallel tabu search algorithms and compares three parallelization techniques applied to Tabucol, a sequential TS algorithm for graph coloring. The experimental results are based on graphs available from the DIMACS...
-
Zero-visibility cops and robber and the pathwidth of a graph
PublicationWe examine the zero-visibility cops and robber graph searching model, which differs from the classical cops and robber game in one way: the robber is invisible. We show that this model is not monotonic. We show that the zero-visibility copnumber of a graph is bounded above by its pathwidth and cannot be bounded below by any nontrivial function of the pathwidth. As well, we define a monotonic version of this game and show that the...
-
Application of genetic algorithms in graph searching problem
PublicationGraph searching is a common approach to solving a problem of capturing a hostile intruder by a group of mobile agents. We assume that this task is performed in environment which we are able to model as a graph G. The question asked is how many agents are needed to capture an arbitrary fast, invisible and smart intruder. This number is called the (edge) search number of G. The strategy which must be performed by agents is called...
-
Zero-Visibility Cops and Robber Game on a Graph
PublicationWe examine the zero-visibility cops and robber graph searching model, which differs from the classical cops & robber game in one way: the robber is invisible. We show that this model is not monotonic. We also provide bounds on both the zero-visibility copnumber and monotonic zero-visibility copnumber in terms of the pathwidth.
-
Weakly convex domination subdivision number of a graph
PublicationA set X is weakly convex in G if for any two vertices a; b \in X there exists an ab–geodesic such that all of its vertices belong to X. A set X \subset V is a weakly convex dominating set if X is weakly convex and dominating. The weakly convex domination number \gamma_wcon(G) of a graph G equals the minimum cardinality of a weakly convex dominating set in G. The weakly convex domination subdivision number sd_wcon (G) is the minimum...
-
Multi-agent graph searching and exploration algorithms
PublicationA team of mobile entities, which we refer to as agents or searchers interchangeably, starting from homebases needs to complete a given task in a graph.The goal is to build a strategy, which allows agents to accomplish their task. We analyze strategies for their effectiveness (e.g., the number of used agents, the total number of performed moves by the agents or the completion time).Currently, the fields of on-line (i.e., agents...
-
Efficient parallel query processing by graph ranking
PublicationW artykule analizujemy przybliżony algorytm dla problemu szukania drzewa spinającego o minimalnym uporządkowanym indeksie chromatycznym, co znajduje zastosowanie w równoległym przetwarzaniu zapytań w relacyjnych bazach danych. Podajemy nowe oszacowanie uporządkowanego indeksu chromatycznego drzewa, które prowadzi do uzyskania lepszej funkcji dobroci wspomnianego algorytmu.
-
A collection of directed graphs for the minimum cycle mean weight computation
Open Research DataThis dataset contains definitions of the 16 directed graphs with weighted edges that were described in the following paper: Paweł Pilarczyk, A space-efficient algorithm for computing the minimum cycle mean in a directed graph, Journal of Mathematics and Computer Science, 20 (2020), no. 4, 349--355, DOI: 10.22436/jmcs.020.04.08, URL: http://dx.doi.org/10.22436/jmcs.020.04.08 These...
-
Photogrammetric and computerized report on site model in feasibility study of navigability channel on vistula spit
PublicationIn the report the authors present a course of geodesic and geo-computerized works upon realization of feasibility study of navigability channel on Vistula Spit. A procedure of acquiring verification and modeling of data for requirements of a numeric model of a bottom and site has been presented with construction of original software for 3D visualization of the Vistula Spit area. The activities described in the report can be...
-
Application of Msplit method for filtering airborne laser scanning data sets to estimate digital terrain models
PublicationALS point cloud filtering involves the separation of observations representing the physical terrain surface from those representing terrain details. A digital terrain model (DTM) is created from a subset of points representing the ground surface. The accuracy of the generated DTM is influenced by several factors, including the survey method used, the accuracy of the source data, the applied DTM generation algorithm, and the survey...
-
Better polynomial algorithms for scheduling unit-length jobs with bipartite incompatibility graphs on uniform machines
PublicationThe goal of this paper is to explore and to provide tools for the investigation of the problems of unit-length scheduling of incompatible jobs on uniform machines. We present two new algorithms that are a significant improvement over the known algorithms. The first one is Algorithm 2 which is 2-approximate for the problem Qm|p j = 1, G = bisubquartic|Cmax . The second one is Algorithm 3 which is 4-approximate for the problem Qm|p...
-
Modelling of ic engine coolant system with permanent magnet brushless motor - bond graphs approach
PublicationW pierwszej części referatu przedstawiono strukturę i podstawy modelowania w ujęciu grafów wiązań nowoczesnego (nowej generacji) systemu chłodzenia silnika spalinowego. Istotną cechą rozważnego systemu chłodzenia jest zastosowanie zintegrowanego układu: pompa cieczy chłodzącej-bezszczotkowy silniki prądu stałego (BSPS, ang. BDCM). W kolejnych częściach referatu przedstawiono: podstawy modelowania całego systemu chłodzenia, model...
-
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...
-
Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs
PublicationGiven a graph G= (V, E), the subdivision of an edge e=uv∈E(G) means the substitution of the edge e by a vertex x and the new edges ux and xv. The domination subdivision number of a graph G is the minimum number of edges of G which must be subdivided (where each edge can be subdivided at most once) in order to increase the domination number. Also, the domination multisubdivision number of G is the minimum number of subdivisions...
-
Dynamic Behavior of Aluminum Alloy Aw 5005 Undergoing Interfacial Friction and Specimen Configuration in Split Hopkinson Pressure Bar System at High Strain Rates and Temperatures
Publication -
Split-beam echosounder data from Gdansk Deep Summer 2019
Open Research DataThe acoustic data was collected in 2019, in the Gdansk Deep, in the season: Summer. Data was collected during the day and night. Three split-beam echosounders with frequencies of 38 kHz, 120 kHz and 333 kHz were used to collect the data. The data was collected while the ship was sailing. To ensure data quality, echosounders were calibrated and passive...
-
Split-beam echosounder data from Puck Bay autumn 2018
Open Research DataThe acoustic data was collected in 2018, in the Bay of Puck, in the seasons: autumn. Data was collected during the day and night. Three split-beam echosounders with frequencies of 38 kHz, 120 kHz and 333 kHz were used to collect the data. The data was collected at a designated study area not far from the city of Hel, while the ship was sailing. To ensure...
-
Split-beam echosounder data from Puck Bay spring 2019
Open Research DataThe acoustic data was collected in 2019, in the Bay of Puck, in the season: spring. Data was collected during the day and night. Three split-beam echosounders with frequencies of 38 kHz, 120 kHz and 333 kHz were used to collect the data. The data was collected at a designated study area not far from the city of Hel, while the ship was sailing. To ensure...
-
Split-beam echosounder data from Puck Bay winter 2019
Open Research DataThe acoustic data was collected in 2019, in the Bay of Puck, in the season: winter. Data was collected during the day and night. Three split-beam echosounders with frequencies of 38 kHz, 120 kHz and 333 kHz were used to collect the data. The data was collected at a designated study area not far from the city of Hel, on the route Hel - Gdynia and on...
-
COMPUTER GRAPHICS FORUM
Journals -
COMPUTERS & GRAPHICS-UK
Journals -
COMPUTER GRAPHICS WORLD
Journals -
JOURNAL FOR GEOMETRY AND GRAPHICS
Journals -
COMPUTER GRAPHICS-US
Journals -
Journal of Image and Graphics
Journals -
ACM TRANSACTIONS ON GRAPHICS
Journals -
Computers and Graphics: X
Journals -
Graphics and Visual Computing
Journals -
Greedy algorithms for backbone graph coloring in KOALA library
Publication -
Nordhaus-Gaddum results for the convex domination number of a graph
PublicationPraca dotyczy nierówności typu Nordhausa-Gadduma dla dominowania wypukłego.
-
On Tradeoffs Between Width- and Fill-like Graph Parameters
PublicationIn this work we consider two two-criteria optimization problems: given an input graph, the goal is to find its interval (or chordal) supergraph that minimizes the number of edges and its clique number simultaneously. For the interval supergraph, the problem can be restated as simultaneous minimization of the path width pw(G) and the profile p(G) of the input graph G. We prove that for an arbitrary graph G and an integer t ∈ {1,...
-
On the complexity of distributed graph coloring with local minimality constraints
PublicationArtykuł traktuje o zachłannym kolorowaniu grafów w modelu rozproszonym. Omówiono algorytmy rozproszone, dające w wyniku pokolorowanie spełniające warunki dla pokolorowań sekwencyjnych typu S oraz Largest-First (LF). Udowodniono również, że każda rozproszona implementacja algorytmu S wymaga co najmniej Omega(log n / log log n) rund, a algorytmu LF co najmniej Omega (n^{1/2}) rund, gdzie n oznacza liczbę wierzchołków grafu.
-
Relations between the domination parameters and the chromatic index of a graph
PublicationIn this paper we show bounds for the sum and the product of the domination parameters and the chromatic index of a graph. We alsopresent some families of graphs for which these bounds are achieved.