[go: up one dir, main page]

El-Mallah et al., 1990 - Google Patents

On two dual classes of planar graphs

El-Mallah et al., 1990

View PDF
Document ID
17192928938247818382
Author
El-Mallah E
Colbourn C
Publication year
Publication venue
Discrete mathematics

External Links

Snippet

A planar graph G is delta-wye “Δ-Y” reducible if G can be reduced to an edge by a sequence of Δ-Y, series, parallel and degree-1 reductions. Politof characterizes Δ-Y reducible graphs in terms of forbidden homeomorphic subgraphs. A wye-delta “Y-Δ” reducible graph is one …
Continue reading at www.sciencedirect.com (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/40—Transformations of program code
    • G06F8/41—Compilation

Similar Documents

Publication Publication Date Title
Arnborg et al. An algebraic theory of graph reduction
Eppstein Parallel recognition of series-parallel graphs
Munagala et al. I/O-complexity of graph algorithms
Freuder Synthesizing constraint expressions
Tedder et al. Simpler linear-time modular decomposition via recursive factorizing permutations
Gawrychowski et al. Better tradeoffs for exact distance oracles in planar graphs
Georgiadis et al. Strong connectivity in directed graphs under failures, with applications
US8132163B2 (en) Method and apparatus for automatic second-order predictive commoning
Gómez-Rodríguez et al. A transition-based parser for 2-planar dependency structures
El-Mallah et al. On two dual classes of planar graphs
Reid-Miller et al. List ranking and parallel tree contraction
Schoenmakers A new algorithm for the recognition of series parallel graphs
Dalirrooyfard et al. Induced cycles and paths are harder than you think
Cen et al. Edge connectivity augmentation in near-linear time
Amilhastre et al. FA minimisation heuristics for a class of finite languages
Matula et al. Two linear-time algorithms for five-coloring a planar graph
Fraigniaud et al. An optimal ancestry labeling scheme with applications to XML trees and universal posets
Polzin et al. Extending reduction techniques for the Steiner tree problem
He et al. Inferring phylogenetic relationships avoiding forbidden rooted triplets
Ahn et al. Towards constant-factor approximation for chordal/distance-hereditary vertex deletion
Pilipczuk Computing tree decompositions
Blikstad Sublinear-round parallel matroid intersection
Cole et al. Tighter upper bounds on the exact complexity of string matching
Hirst et al. On the power of bounded concurrency II: Pushdown automata
Maheshwari et al. I/O-efficient planar separators