X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
carving-width (9) 9
graphs (5) 5
algorithms (4) 4
branch-width (4) 4
mathematical analysis (3) 3
mathematics, applied (3) 3
[ info.info-dm ] computer science [cs]/discrete mathematics [cs.dm] (2) 2
algorithm (2) 2
carving width (2) 2
computer science (2) 2
discrete mathematics (2) 2
discrete mathematics and combinatorics (2) 2
graph (2) 2
graph drawing (2) 2
graph minors (2) 2
mathematics (2) 2
point-set embedding (2) 2
rank-width (2) 2
theoretical computer science (2) 2
apexes (1) 1
boundary edge (1) 1
branchwidth (1) 1
combinatorial analysis (1) 1
computational geometry (1) 1
computational theory and mathematics (1) 1
computer science, theory & methods (1) 1
computing (1) 1
congestion (1) 1
connectivity function (1) 1
constants (1) 1
containment (1) 1
drawing colored graphs (1) 1
edge-isoperimetric inequalities (1) 1
embedding (1) 1
embeddings (1) 1
even (1) 1
even grid (1) 1
extension (1) 1
few-crossings (1) 1
fixed-parameter tractability (1) 1
foundations (1) 1
grid (1) 1
grids (1) 1
hamming graph (1) 1
heuristic search (1) 1
hypercube (1) 1
hypercubes (1) 1
immersion (1) 1
logic (1) 1
mapping (1) 1
minors (1) 1
numbers (1) 1
obstruction set (1) 1
obstructions (1) 1
planar (1) 1
planes (1) 1
polynomials (1) 1
recognition (1) 1
roots (1) 1
sat encoding (1) 1
square roots of graphs (1) 1
symmetric submodular function (1) 1
tangle (1) 1
theoretical (1) 1
torus (1) 1
towards (1) 1
trees (1) 1
treewidth (1) 1
width (1) 1
アルゴリズム (1) 1
カービング幅 (1) 1
グラフ (1) 1
コンピュテーション (1) 1
偶 グリッド (1) 1
偶グリッド (1) 1
境界辺 (1) 1
小交差数 (1) 1
幅 (1) 1
平面 (1) 1
拡張 (1) 1
決定 (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


ACM Transactions on Computational Logic (TOCL), ISSN 1529-3785, 07/2019, Volume 20, Issue 3, pp. 1 - 24
Branch decomposition is a prominent method for structurally decomposing a graph, a hypergraph, or a propositional formula in conjunctive normal form. The width... 
carving-width | Branchwidth | SAT encoding | heuristic search | WIDTH | COMPUTER SCIENCE, THEORY & METHODS | LOGIC
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 05/2014, Volume 168, pp. 34 - 39
Let G be a graph class. The square root of G contains all graphs whose squares belong in G. We prove that if G is non-trivial and minor closed, then all graphs... 
Carving-width | Square roots of graphs | Graph minors | Branch-width | MATHEMATICS, APPLIED | CONTAINMENT | ALGORITHMS | Algorithms | Graphs | Mathematical analysis | Roots | Recognition | Computer Science | Discrete Mathematics
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 2013, Volume 161, Issue 13-14, pp. 1888 - 1893
We characterize all graphs that have carving-width at most  k for k=1,2,3. In particular, we show that a graph has carving-width at most 3 if and only if it... 
Carving-width | Obstruction set | Immersion | MATHEMATICS, APPLIED | OBSTRUCTIONS | Graphs | Obstructions | Mathematical analysis | Computer Science | Discrete Mathematics
Journal Article
International Journal of Computational Geometry and Applications, ISSN 0218-1959, 2013, Volume 23, Issue 4-5, pp. 357 - 395
In this paper, we study the point-set embeddability problem, i.e., given a planar graph and a set of points, is there a mapping of the vertices to the points... 
Graph drawing | carving width | point-set embedding | MINORS | DRAWING COLORED GRAPHS | MATHEMATICS, APPLIED | EMBEDDINGS | ALGORITHMS | Drawing | Computational geometry | Planes | Constants | Graphs | Polynomials | Mapping | Combinatorial analysis
Journal Article
Discrete Mathematics, ISSN 0012-365X, 2010, Volume 310, Issue 21, pp. 2867 - 2876
The carving-width of a graph is the minimum congestion of routing trees for the graph. We determine the carving-width of generalized hypercubes: Hamming... 
Carving-width | Hamming graph | Torus | Hypercube | Grid | GRAPH | MATHEMATICS | NUMBERS | TREEWIDTH | EDGE-ISOPERIMETRIC INEQUALITIES | Trees | Graphs | Hypercubes | Congestion | Mathematical analysis
Journal Article
Journal of Combinatorial Theory, Series B, ISSN 0095-8956, 2007, Volume 97, Issue 3, pp. 385 - 393
An integer-valued function f on the set 2 V of all subsets of a finite set V is a connectivity function if it satisfies the following conditions: (1) f ( X ) +... 
Connectivity function | Carving-width | Symmetric submodular function | Rank-width | Tangle | Branch-width | carving-width | MATHEMATICS | branch-width | tangle | rank-width | ALGORITHM | symmetric submodular function | connectivity function | Algorithms
Journal Article
Leibniz International Proceedings in Informatics, LIPIcs, ISSN 1868-8969, 07/2018, Volume 107
Conference Proceeding
Proceedings of the twenty-eighth annual symposium on computational geometry, 06/2012, pp. 41 - 50
In this paper, we study the point-set-embeddability-problem, i.e., given a planar graph and a set of points, is there a mapping of the vertices to the points... 
carving width | graph drawing | point-set embedding | Graph drawing | Carving width | Point-set embedding
Conference Proceeding
Electronic Notes in Discrete Mathematics, ISSN 1571-0653, 12/2011, Volume 38, pp. 681 - 686
Let G be a graph class. The square root of G contains all graphs whose square belong in G. We prove that if G is non-trivial and minor closed, then all graphs... 
Carving-width | Graph minors | Branch-width | Algorithms
Journal Article
電子情報通信学会技術研究報告. COMP, コンピュテーション, ISSN 0913-5685, 10/2008, Volume 108, pp. 71 - 75
グラフのカービング幅の概念が,SeymourとThomas [Call routing and the ratcatcher. Combinatorica 14(2)... 
Journal Article
情報処理学会研究報告アルゴリズム(AL), ISSN 0919-6072, 03/2008, Volume 2008, pp. 67 - 74
平面グラフの刻み幅を決定する Seymour と Thomas の「ねずみ捕りアルゴリズム」の正当性証明のひとつの鍵となる補題の新しい証明を与える.この証明は,ねずみ捕りアルゴリズムを平面グラフよりも広いクラスに拡張するための基礎となると期待される.We give a new proof of a key lemma... 
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.