Search results for: GRAPH
-
An upper bound on the total outer-independent domination number of a tree
PublicationA total outer-independent dominating set of a graph G=(V(G),E(G)) is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every tree T of order n >= 4, with l leaves and s support vertices we have...
-
Drawing maps with advice
PublicationW pracy podejmujemy temat konstrukcji algorytmu dla agenta, który zostaje umieszczony w dowolnym wierzchołku grafu (wierzchołki są nierozróżnialne, krawędzie mają etykiety portów), po czym realizuje algorytm zmierzający do znalezienia drzewa spinającego grafu lub izomorficznej kopii grafu. Dla obu problemów podajemy asymptotycznie dokładne lub prawie dokładne oszacowania na ilość bitów dodatkowej informacji, którą agent musi otrzymać...
-
Liczby Ramseya on-line dla różnych klas grafów
PublicationRozpatrujemy grę rozgrywaną na nieskończonej liczbie wierzchołków, w której każda runda polega na wskazaniu krawędzi przez jednego gracza - Budowniczego oraz pokolorowaniu jej przez drugiego gracza - Malarkę na jeden z dwóch kolorów, czerwony lub niebieski. Celem Budowniczego jest zmuszenie Malarki do stworzenia monochromatycznej kopii wcześniej ustalonego grafu H w jak najmniejszej możliwej liczbie ruchów. Zakładamy, że gracze...
-
The complexity of bicriteria tree-depth
PublicationThe tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph G. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some input integer b. We are interested in the case when G is the line graph of a tree, proving that the problem is NP-hard and obtaining a polynomial-time additive 2b-approximation algorithm. This particular...
-
Isolation Number versus Domination Number of Trees
PublicationIf G=(VG,EG) is a graph of order n, we call S⊆VG an isolating set if the graph induced by VG−NG[S] contains no edges. The minimum cardinality of an isolating set of G is called the isolation number of G, and it is denoted by ι(G). It is known that ι(G)≤n3 and the bound is sharp. A subset S⊆VG is called dominating in G if NG[S]=VG. The minimum cardinality of a dominating set of G is the domination number, and it is denoted by γ(G)....
-
2-Coloring number revisited
Publication2-Coloring number is a parameter, which is often used in the literature to bound the game chromatic number and other related parameters. However, this parameter has not been precisely studied before. In this paper we aim to fill this gap. In particular we show that the approximation of the game chromatic number by the 2-coloring number can be very poor for many graphs. Additionally we prove that the 2-coloring number may grow...
-
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
PublicationOne of the recently considered models of robot-based computing makes use of identical, memoryless mobile units placed in nodes of an anonymous graph. The robots operate in Look-Compute-Move cycles; in one cycle, a robot takes a snapshot of the current configuration (Look), takes a decision whether to stay idle or to move to one of the nodes adjacent to its current position (Compute), and in the latter case makes an instantaneous...
-
On minimum cost edge searching
PublicationWe consider the problem of finding edge search strategies of minimum cost. The cost of a search strategy is the sum of searchers used in the clearing steps of the search. One of the natural questions is whether it is possible to find a search strategy that minimizes both the cost and the number of searchers used to clear a given graph G. We call such a strategy ideal. We prove, by an example, that ideal search strategies do not...
-
A NOTE ON ON-LINE RAMSEY NUMBERS FOR QUADRILATERALS
PublicationWe consider on-line Ramsey numbers defined by a game played between two players, Builder and Painter. In each round Builder draws an the edge and Painter colors it either red or blue, as it appears. Builder’s goal is to force Painter to create a monochromatic copy of a fixed graph H in as few rounds as possible. The minimum number of rounds (assuming both players play perfectly) is the on-line Ramsey number \widetilde{r}(H) of...
-
Necessary and Sufficient Condition for State-Independent Contextual Measurement Scenarios
PublicationThe problem of identifying measurement scenarios capable of revealing state-independent contextuality in a given Hilbert space dimension is considered. We begin by showing that for any given dimension d and any measurement scenario consisting of projective measurements, (i) the measure of contextuality of a quantum state is entirely determined by its spectrum, so that pure and maximally mixed states represent the two extremes...
-
Bounds on the cover time of parallel rotor walks
PublicationThe rotor-router mechanism was introduced as a deterministic alternative to the random walk in undirected graphs. In this model, a set of k identical walkers is deployed in parallel, starting from a chosen subset of nodes, and moving around the graph in synchronous steps. During the process, each node successively propagates walkers visiting it along its outgoing arcs in round-robin fashion, according to a fixed ordering. We consider...
-
Wordventure - cooperative wordnet editor. Architecture for lexical semantic aquisition
PublicationThis article presents architecture for acquiring lexical semanticsin a collaborative approach paradigm. The system enablesfunctionality for editing semantic networks in a wikipedia-like style. The core of the system is a user-friendly interface based on interactive graph navigation.It has been used for semantic network presentation,and brings simultaneously modification functionality.
-
WordVenture - COOPERATIVE WordNet EDITOR Architecture for Lexical Semantic Acquisition
PublicationThis article presents architecture for acquiring lexical semantics in a collaborative approach paradigm. The system enables functionality for editing semantic networks in a wikipedia-like style. The core of the system is a user-friendly interface based on interactive graph navigation. It has been used for semantic network presentation, and brings simultaneously modification functionality.
-
Distributed NVRAM Cache – Optimization and Evaluation with Power of Adjacency Matrix
PublicationIn this paper we build on our previously proposed MPI I/O NVRAM distributed cache for high performance computing. In each cluster node it incorporates NVRAMs which are used as an intermediate cache layer between an application and a file for fast read/write operations supported through wrappers of MPI I/O functions. In this paper we propose optimizations of the solution including handling of write requests with a synchronous mode,...
-
Turán numbers for odd wheels
PublicationThe Turán number ex(n,G) is the maximum number of edges in any n-vertex graph that does not contain a subgraph isomorphic to G. A wheel W_n is a graph on n vertices obtained from a C_{n−1} by adding one vertex w and making w adjacent to all vertices of the C_{n−1}. We obtain two exact values for small wheels: ex(n,W_5)=\lfloor n^2/4+n/2\rfloor, ex(n,W_7)=\lfloor n^2/4+n/2+1 \rfloor. Given that ex(n,W_6) is already known, this...
-
A Systematic Search for New Coupling Schemes of Cross-Coupled Resonator Bandpass Filters
PublicationIn this paper, a systematic approach to an extensive search for topologies of cross-coupled filters with generalized Chebyshev response is presented. The technique applies graph theory to find unique, nonisomorphic filter configurations, and tests whether a specific frequency response can be realized in a given set of topologies. The results of the search are then stored in a database of possible filter configurations.
-
New potential functions for greedy independence and coloring
PublicationA potential function $f_G$ of a finite, simple and undirected graph $G=(V,E)$ is an arbitrary function $f_G : V(G) \rightarrow \mathbb{N}_0$ that assigns a nonnegative integer to every vertex of a graph $G$. In this paper we define the iterative process of computing the step potential function $q_G$ such that $q_G(v)\leq d_G(v)$ for all $v\in V(G)$. We use this function in the development of new Caro-Wei-type and Brooks-type...
-
Optimal edge-coloring with edge rate constraints
PublicationWe consider the problem of covering the edges of a graph by a sequence of matchings subject to the constraint that each edge e appears in at least a given fraction r(e) of the matchings. Although it can be determined in polynomial time whether such a sequence of matchings exists or not [Grötschel et al., Combinatorica (1981), 169–197], we show that several questions about the length of the sequence are computationally intractable....
-
A note on mixed tree coloring
PublicationZaproponowano liniowy algorytm dla problemu kolorowania mieszanego w drzewach, uzyskując tym samym poprawę w stosunku do algorytmu o złożoności O(n^2) podanego w pracy [P. Hansen, J. Kuplinsky, D. de Werra, Mixed graph colorings, Math. Methods Oper. Res. 45 (1997) 145-160].
-
Network Approach to Increments of RR-intervals for Visualization of Dynamics of Cardiac Regulation
PublicationThe transition network for RR -increments is pre- sented in a directed and weighted graph, with vertices represent- ing RR -increments and edges corresponding to the order in a sequence of increments. The adjacency matrix and the transition matrix of this network provide a graphical tool which could be useful in the assessment of cardiac regulation. As an example, the method is applied in detecting differences between diurnal activity...
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm.
PublicationWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm
PublicationWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.
-
Recognition, understanding and aestheticization of freehand drawing flowcharts
PublicationIn this paper a concept of FCA, a system for recognizing, understanding and aestheticization of freehand drawing flow charts is described. The system is based on a proposed by the author FlowGram graph grammar describing flow charts drawing. An open format FlowChartML for flow charts description is also proposed. The aestheticization criterion is formulated that allows for automatic beautification of flow charts. First experiments...
-
On zero-error codes produced by greedy algorithms
PublicationWe present two greedy algorithms that determine zero-error codes and lower bounds on the zero-error capacity. These algorithms have many advantages, e.g., they do not store a whole product graph in a computer memory and they use the so-called distributions in all dimensions to get better approximations of the zero-error capacity. We also show an additional application of our algorithms.
-
Separability Assessment of Selected Types of Vehicle-Associated Noise
PublicationMusic Information Retrieval (MIR) area as well as development of speech and environmental information recognition techniques brought various tools in-tended for recognizing low-level features of acoustic signals based on a set of calculated parameters. In this study, the MIRtoolbox MATLAB tool, designed for music parameter extraction, is used to obtain a vector of parameters to check whether they are suitable for separation of...
-
Complexity Issues on of Secondary Domination Number
PublicationIn this paper we study the computational complexity issues of the problem of secondary domination (known also as (1, 2)-domination) in several graph classes. We also study the computational complexity of the problem of determining whether the domination and secondary domination numbers are equal. In particular, we study the influence of triangles and vertices of degree 1 on these numbers. Also, an optimal algorithm for finding...
-
Application of Doubly Connected Dominating Sets to Safe Rectangular Smart Grids
PublicationSmart grids, together with the Internet of Things, are considered to be the future of the electric energy world. This is possible through a two-way communication between nodes of the grids and computer processing. It is necessary that the communication is easy and safe, and the distance between a point of demand and supply is short, to reduce the electricity loss. All these requirements should be met at the lowest possible cost....
-
The complexity of minimum-length path decompositions
PublicationWe consider a bi-criteria generalization of the pathwidth problem, where, for given integers k, l and a graph G, we ask whether there exists a path decomposition P of G such that the width of P is at most k and the number of bags in P, i.e., the length of P, is at most l. We provide a complete complexity classification of the problem in terms of k and l for general graphs. Contrary to the original pathwidth problem, which is fixed-parameter...
-
No-Wait & No-Idle Open Shop Minimum Makespan Scheduling with Bioperational Jobs
PublicationIn the open shop scheduling with bioperational jobs each job consists of two unit operations with a delay between the end of the first operation and the beginning of the second one. No-wait requirement enforces that the delay between operations is equal to 0. No-idle means that there is no idle time on any machine. We model this problem by the interval incidentor (1, 1)-coloring (IIR(1, 1)-coloring) of a graph with the minimum...
-
Impedance spectra of ZnO varistor type 440 model A ver. M
Open Research DataThe impedance spectrum of high-voltage ZnO varistor obtained using FRA EIS impedance spectrosocpy measurement method. The 1V sinusoidal excitation was used. The frequency range was chosen from 10 kHz down to 100 uHz. The object under test and the measuring instrument were placed in a Faraday cage due to high impedance of the object. The data was acquired...
-
Impedance spectra of ZnO varistor type 680 model A M ver. 93
Open Research DataThe impedance spectrum of high-voltage ZnO varistor obtained using FRA EIS impedance spectrosocpy measurement method. The 1V sinusoidal excitation was used. The frequency range was chosen from 10 kHz down to 100 uHz. The object under test and the measuring instrument were placed in a Faraday cage due to high impedance of the object. The data was acquired...
-
Impedance spectra of ZnO varistor type 680 model O M ver. 65 13
Open Research DataThe impedance spectrum of high-voltage ZnO varistor obtained using FRA EIS impedance spectrosocpy measurement method. The 1V sinusoidal excitation was used. The frequency range was chosen from 10 kHz down to 100 uHz. The object under test and the measuring instrument were placed in a Faraday cage due to high impedance of the object. The data was acquired...
-
Impedance spectra of ZnO varistor type 680 model A M ver. xx
Open Research DataThe impedance spectrum of high-voltage ZnO varistor obtained using FRA EIS impedance spectrosocpy measurement method. The 1V sinusoidal excitation was used. The frequency range was chosen from 10 kHz down to 100 uHz. The object under test and the measuring instrument were placed in a Faraday cage due to high impedance of the object. The data was acquired...
-
Impedance spectra of ZnO varistor type 280 model A ver. M
Open Research DataThe impedance spectrum of high-voltage ZnO varistor obtained using FRA EIS impedance spectrosocpy measurement method. The 1V sinusoidal excitation was used. The frequency range was chosen from 10 kHz down to 100 uHz. The object under test and the measuring instrument were placed in a Faraday cage due to high impedance of the object. The data was acquired...
-
Impedance spectra of ZnO varistor type 280 model 0 ver. 89
Open Research DataThe impedance spectrum of high-voltage ZnO varistor obtained using FRA EIS impedance spectrosocpy measurement method. The 1V sinusoidal excitation was used. The frequency range was chosen from 10 kHz down to 100 uHz. The object under test and the measuring instrument were placed in a Faraday cage due to high impedance of the object. The data was acquired...
-
Impedance spectra of ZnO varistor type 280 model O ver. 68
Open Research DataThe impedance spectrum of high-voltage ZnO varistor obtained using FRA EIS impedance spectrosocpy measurement method. The 1V sinusoidal excitation was used. The frequency range was chosen from 100 kHz down to 100 uHz. The object under test and the measuring instrument were placed in a Faraday cage due to high impedance of the object. The data was acquired...
-
Impedance spectra of ZnO varistor type 440 model O ver. 68
Open Research DataThe impedance spectrum of high-voltage ZnO varistor obtained using FRA EIS impedance spectrosocpy measurement method. The 1V sinusoidal excitation was used. The frequency range was chosen from 10 kHz down to 10 uHz. The object under test and the measuring instrument were placed in a Faraday cage due to high impedance of the object. The data was acquired...
-
Impedance spectra of ZnO varistor type 680 model O M ver. 65 60
Open Research DataThe impedance spectrum of high-voltage ZnO varistor obtained using FRA EIS impedance spectrosocpy measurement method. The 1V sinusoidal excitation was used. The frequency range was chosen from 10 kHz down to 10 uHz. The object under test and the measuring instrument were placed in a Faraday cage due to high impedance of the object. The data was acquired...
-
Generalized Gradient Equivariant Multivalued Maps, Approximation and Degree
PublicationConsider the Euclidean space Rn with the orthogonal action of a compact Lie group G. We prove that a locally Lipschitz G-invariant mapping f from Rn to R can be uniformly approximated by G-invariant smooth mappings g in such a way that the gradient of g is a graph approximation of Clarke’s generalized gradient of f . This result enables a proper development of equivariant gradient degree theory for a class of set-valued gradient...
-
Cooperative Word Net Editor for Lexical Semantic Acquisition
PublicationThe article describes an approach for building Word Net semantic dictionary in a collaborative approach paradigm. The presented system system enables functionality for gathering lexical data in a Wikipedia-like style. The core of the system is a user-friendly interface based on component for interactive graph navigation. The component has been used for Word Net semantic network presentation on web page, and it brings functionalities...
-
GreedyMAX-type Algorithms for the Maximum Independent Set Problem
PublicationA maximum independent set problem for a simple graph G = (V,E) is to find the largest subset of pairwise nonadjacent vertices. The problem is known to be NP-hard and it is also hard to approximate. Within this article we introduce a non-negative integer valued functionp defined on the vertex set V(G) and called a potential function of agraph G, while P(G) = max{vinV(G)| p(v)} is called a potential of G. For any graph P(G) <= D(G),...
-
Reliability of production machines in the bakery industry – theoretical and practical issues
PublicationThe aim of the article is to present probabilistic models, which were then used to analyze the reliability of production machines in the baking industry. The author conducted research in the period from January 2, 2016 to December 31, 2018 regarding the measurement of reliability of a traditional production system based on a probabilistic concept. Due to the limited scope of the article, reliability calculations for a set of thermo-oil...
-
Proposal of a method for effective tasks distribution in the execution of compolex problems
PublicationAn access to a great number of various services allows for decomposition of complex problems into smaller and less complex tasks. Those tasks can be presented in a form of a dependency graph. This paper shows an idea of executing such a problem using cooperating autonomous agents. Main focus of this work is cooperation covering effective tasks distribution among executors. This paper presents an algorithm for dynamic executor selection...
-
ProSIL Software for functional saferty management in life cycle = Aplikacja ProSIL do zarządzania bezpieczeństwem funkcjonalnym w cyklu życia
PublicationIn the paper the ProSIL software to aid the functional safety management is presented. The software consists of three modules to aid: determination of the required SIL level (ProSILen), veryfication of the SIL level (ProSILver). In the aplication the method of the calibrated risk graph to determine the required safety integrity level SIL for defined safety instrumented functions is applied. The methods concerning functional safety...
-
Polyhedral Ramsey Numbers
PublicationGiven two polygons or polyhedrons P1 and P2, we can transform these figures to graphs G1 and G2, respectively. The polyhedral Ramsey number Rp(G1,G2) is the smallest integer n such that every graph, which represents polyhedron on n vertices either contains a copy of G1 or its complement contains a copy of G2. Using a computer search together with some theoretical results we have established some polyhedral Ramsey numbers, for example...
-
Port-Based Modelling of Distributed-Lumped Parameter Systems
PublicationThere in the paper is presented an uniform, port-based approach to modelling of both lumped and distributed parameter systems. Port-based model of the distributed system has been defined by application of bond graph methodology and distributed transfer function method (DTFM). The approach proposed combines versatility of port-based modelling and accuracy of distributed transfer function method. The concise representation of lumped-distributed...
-
Study of the Flow Dynamics of Surface Water Masses in the Area of the Coastal Gulf of Gdansk
PublicationThe paper describes two methods of predicting the movement of small objects with surface water masses. One of the methods uses graph theory to describe the motion of water masses in port docks. The results of this study were compared to a simulation using the hydrodynamic numerical model M3D. The results obtained in a virtual environment were related to the experiments in the real world. In the coastal area of the Gulf of Gdansk,...
-
On-line Search in Two-Dimensional Environment
PublicationWe consider the following on-line pursuit-evasion problem. A team of mobile agents called searchers starts at an arbitrary node of an unknown network. Their goal is to execute a search strategy that guarantees capturing a fast and invisible intruder regardless of its movements using as few searchers as possible. We require that the strategy is connected and monotone, that is, at each point of the execution the part of the graph...
-
Rearrangeability in multicast Clos networks is NP-complete
PublicationPrzestrajalność w polach Closa z połączeniami jeden do jeden jest problemem wielomianowym. W pracy pokazano, że w polach z połączeniami jeden do wiele problem ten jest NP zupełny.Three-stage elos networks are commutation networks with circuit switching. So far, graph theory has been very useful tool for solving issues related to these networks with unicast connections. This is so because if elos network is represented as a bipartite...
-
Zastosowanie odcinków nieliniowej krzywizny w torze zwrotnym rozjazdu kolejowego
PublicationW pracy została przedstawiona analityczna metoda kształtowania toru zwrotnego rozjazdu kolejowego posiadającego na swojej długości odcinki nieliniowej krzywizny. Odcinki te służą łagodzeniu wykresu krzywizny w skrajnych strefach rozjazdu W omawianej metodzie dokonano identyfikacji problemu rozkładu krzywizny za pomocą równań różniczkowych. Uzyskane rozwiązania mają charakter uniwersalny; m. in. pozwalają na przyjmowanie dowolnych...