Buscar
Mostrando ítems 1-10 de 33
Proper Hamiltonian Paths in Edge-Colored Multigraphs
(Elsevier, 2011-12)
A c-edge-colored multigraph has each edge colored with one of the c available colors and no two parallel edges have the same color. A proper hamiltonian path is a path containing all the vertices of the multigraph such ...
Proper hamiltonian paths in edge-coloured multigraphs
(Springer Tokyo, 2017-07)
Given a c-edge-coloured multigraph, where c is a positive integer, a proper Hamiltonian path is a path that contains all the vertices of the multigraph such that no two adjacent edges have the same colour. In this work we ...
Representative frequent approximate subgraph mining on multi-graph collections
(Instituto Nacional de Astrofísica, Óptica y Electrónica, 2018)
Representative frequent approximate subgraph mining on multi-graph collections
(Instituto Nacional de Astrofísica, Óptica y Electrónica, 2018)
Towards the Distribution of the Size of a Largest Planar Matching and Largest Planar Subgraph in Random Bipartite Graphs
(ELECTRONIC JOURNAL OF COMBINATORICS, 2008-10-20)
We address the following question: When a randomly chosen regular bipartite multi-graph is drawn in the plane in the "standard way", what is the distribution of its maximum size planar matching (set of non-crossing disjoint ...
On minimal forbidden subgraph characterizations of balanced graphs
(2013)
A graph is balanced if its clique-matrix contains no edge–vertex incidence matrix of an odd
chordless cycle as a submatrix. While a forbidden induced subgraph characterization of
balanced graphs is known, there is no ...
Uma heuristica para o problema de classificação de classificação de conferências explorando relacionamentos múltiplos e indiretos
(Universidade Federal de Minas GeraisUFMG, 2008-12-12)
Extracting usable knowledge from large amounts of data has become one of the main challenges to a variety of fields, such as scientific, industrial or governmental areas. This task requires the data to be represented in a ...
Sucesiones Gráficas
(Facultad de Matemáticas e IngenieríasMatemáticasColombia, 2019-05-29)
Inference and exemplifies a powerful algorithm that allows or not; In abstract, draw a multigraph, given in principle certain hypotheses.