Results 171 to 180 of about 81,779 (307)

Institusionalisasi Pelaporan Dana Kampanye Pemilu Kepala Daerah

Jurnal Riset dan Aplikasi: Akuntansi dan Manajemen, 2018
This reseach aims to understand campaign fund reports phenomena on the elections simultaneously at 2015 in Sidoarjo regency. This study use institutional isomorphism.
Alim Syaiful Fuad, Ade Palupi
doaj  

Graph Isomorphism, General Remarks

, 2012
An open question is the computational complexity of recognizing when two graphs are isomorphic. In an attempt to answer this question we shall analyze the relative computational complexity of generalizations and restrictions of the graph isomorphism ...
Miller, Gary L.
core  

Graph Isomorphism

We review some of the most relevant properties related to graph isomorphism and graph components. First, we introduce some concepts related to graph traversal (walks, paths, cycles, circuits) and we introduce two natural concepts related to connectivity:
Dondi, Riccardo
core   +1 more source

Fractional List Packing for Layered Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT The fractional list packing number χ ℓ • ( G ) ${\chi }_{\ell }^{\bullet }(G)$ of a graph G $G$ is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N $L:V(G)\to {2}^{{\mathbb{N}}}$ need to be to ensure the existence of a “perfectly ...
Stijn Cambie, Wouter Cames van Batenburg
wiley   +1 more source

Extension of partial atom-to-atom maps: uniqueness and algorithms. [PDF]

Algorithms Mol Biol
Laffitte MEG, Phan TL, Stadler PF.
europepmc   +1 more source

A Coarse Geometric Approach to Graph Layout Problems

Journal of Graph Theory, EarlyView.
ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang, David Hume, Samuel J. Kelly, Ryan Lam   +3 more
wiley   +1 more source

A Model Structure on the Category of A ∞ -Categories with Strict Morphisms. [PDF]

Appl Categ Struct
Ornaghi M.
europepmc   +1 more source

On a Clique‐Building Game of Erdős

Journal of Graph Theory, EarlyView.
ABSTRACT The following game was introduced in a list of open problems from 1983 attributed to Erdős: two players take turns claiming edges of a Kn ${K}_{n}$ until all edges are exhausted. Player 1 wins the game if the largest clique that they claim at the end is strictly larger than the largest clique of their opponent; otherwise, Player 2 wins the ...
Alexandru Malekshahian, Sam Spiro
wiley   +1 more source

Robustness of Topological Phases on Aperiodic Lattices. [PDF]

Math Phys Anal Geom
Li Y.
europepmc   +1 more source

Chromatic Ramsey Numbers and Two‐Color Turán Densities

Journal of Graph Theory, EarlyView.
ABSTRACT Given a graph G, its 2‐color Turán number ex ( 2 ) ( n , G ) is the maximum number of edges in an n‐vertex graph, such that the edges can be colored with two colors avoiding a monochromatic copy of G. Let π ( 2 ) ( G ) = lim n → ∞ ex ( 2 ) ( n , G ) / n 2 be the 2‐color Turán density of G.
Maria Axenovich, Simon Gaa, Dingyuan Liu
wiley   +1 more source