ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Technology
Mathematics
Computing
Agronomy and forestry
Biology
Education
Computing
Environment
Architecture and Urbanism
Research
all records (74)

Languages
English
Spanish
Portuguese
German
French
Finnish

Countries
Indonesia
USA
Australia
Brazil
Ukraine
Spain
Chile
Italy
Romania
South Africa
all records (79)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
21.002  Articles
1 of 2.101 pages  |  10  records  |  more records»
Representasi graf banyak digunakan, salah satunya untuk menggambarkan proses berpikir siswa. Caranya dengan melihat hubungan antara langkah penyelesaian satu dengan lainnya dalam menyelesaikan masalah matematika. Penelitian ini bertujuan untuk merepresent... see more

A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the tiered trees in... see more

A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the tiered trees in... see more

In 2011, Beeler and Hoilman generalized the game of peg solitaire to arbitrary connected graphs. Since then peg solitaire has been considered on quite a few classes of graphs. Beeler and Gray introduced the natural idea of adding edges to make an unsolvab... see more

The dangers of health problems in dental disease are common for children and adults. Many dental problems get priority treatment based on data from Riskesdas, about 67.6% of the Indonesian population suffers from dental and oral problems. This affects oth... see more

Given a positive integer k and a graph G = (V, E), a function f from V to the power set of Ik is called a k-rainbow function if for each vertex v ? V, f(v)=Ø implies ?u ? N(v)f(u)=Ik&nb... see more

An st-path in a drawing of a graph is self-approaching if during the traversal of the corresponding curve from s to any point t' on the curve the distance to t' is non-increasing. A path has increasing chords if it is self-approaching in bo... see more

The path planning of anti-ship missile should be considered both cruising in safety and striking in quick, which is an intractable problem. In particular, it is difficult to consider the safety of each missile path in the path planning of multiple missile... see more

The paper presents a new original algorithm for solving Steiner tree problem on graph. The algorithm is simple and intended for solving problems with relatively low dimensions. It is based on use of existing open source software for solving integer linear... see more

1 of 2.101 pages  |  10  records  |  more records»